These forums are CLOSED. Please visit the new forums HERE
new collision detection 1000 times faster! |
|
|
paulie Femto
Into the dark
Join date: 13 Sep 2003
Posts: 1,098
|
10-18-2005 20:17
Check this: a new collision detection method that's fast fast!
http://blogs.zdnet.com/emergingtech/?p=46 It's so fast, it can "perform collision detection with deformable models at costs comparable to collision detection with rigid objects." Woot. _____________________
REUTERS on SL: "Thirty-five thousand people wearing their psyches on the outside and all the attendant unfettered freakishness that brings."
|
|
Jesrad Seraph
Nonsense
Join date: 11 Dec 2004
Posts: 1,463
|
10-18-2005 23:16
Seems to me like a spherical equivalent to convex bounding binary seperation tree.
In a computer, the shape of an object is typically represented by tens of thousands of tiny triangles. In conventional programs, when an object collides with something, the shape of each triangle is recomputed, based on physical principles. Err, not. It generally uses layers of progressive complexity for representing the object, only advancing complexity for the "potential collision" regions of the object until the exact calculation is made. I'm not convinced this could be that much faster, especially with objects that have flat faces instead of curved, round shapes. I can only see on advantage, in that it might be much faster to generate the tree from the object's model as needed instead of keeping it in memory. Hence the logical use in deformable bodies instead of rigid. _____________________
Either Man can enjoy universal freedom, or Man cannot. If it is possible then everyone can act freely if they don't stop anyone else from doing same. If it is not possible, then conflict will arise anyway so punch those that try to stop you. In conclusion the only strategy that wins in all cases is that of doing what you want against all adversity, as long as you respect that right in others.
|
|
Hiro Pendragon
bye bye f0rums!
Join date: 22 Jan 2004
Posts: 5,905
|
10-19-2005 00:23
This is such an elegant idea. I wonder how the algorithm works to determine sub-spheres and not miss any areas...
_____________________
Hiro Pendragon
------------------ http://www.involve3d.com - Involve - Metaverse / Emerging Media Studio Visit my SL blog: http://secondtense.blogspot.com |
|
Adam Zaius
Deus
Join date: 9 Jan 2004
Posts: 1,483
|
10-19-2005 00:40
Havok already does most of this (Havok has several phases, the first being a broadphase which ignores anything which couldnt collide completely); the algorithm being presented is an alternative to the 'brute force' collision equivilent, doesnt look too revolutionary from here...
_____________________
|
|
Eggy Lippmann
Wiktator
Join date: 1 May 2003
Posts: 7,939
|
10-19-2005 00:48
I think you're missing the point here... this is for deformable objects. We do not currently have those.
_____________________
|
|
Jesrad Seraph
Nonsense
Join date: 11 Dec 2004
Posts: 1,463
|
10-19-2005 02:11
Agreed, the point is that it doesn't need to regenerate a BSP model (or axis aligned bounding boxes tree) of the deformed regions, it can use some simpler method to divide it in smaller and smaller spheres on demand.
_____________________
Either Man can enjoy universal freedom, or Man cannot. If it is possible then everyone can act freely if they don't stop anyone else from doing same. If it is not possible, then conflict will arise anyway so punch those that try to stop you. In conclusion the only strategy that wins in all cases is that of doing what you want against all adversity, as long as you respect that right in others.
|
|
Kurt Zidane
Just Human
Join date: 1 Apr 2004
Posts: 636
|
10-19-2005 07:46
I can't believe no one has though about using this before. Calculate the length of a line between to points in 3 demential space, and subtract the radiuses of both objects from the line. If the result is not greater then zero, collision is detected. I can't believe how beautiful it is.
|
