Kelvin Chung wrote:
>is return for USE_BOUNDS. Otherwise, for USE_GEOMETRY, current
>implemetation do a brute force O(n^2) check for each triangle.
>So the first pass is pretty quick but the second pass is very
>slow.
Ok, for the article - clarification point - even if you are have
USE_GEOMETRY, it will do a fast bounds cull first and then do polygonal
tests on the remaining contentious bounding boxes.
Now second question: Are you doing anything like checking for vectors of
the polygons that are facing in the direction of the contact point? I'm
wondering if the collisions are assuming twosided polygons and testing
every single polygon in the object or if you are doing a visibility
style backface cull of polygons that can't be seen from the current
"position" before doing tests on actual polygon intersections? I suppose
you can't do this on object to object collisions, but viewpoint to
object collisions it should give a significant performance increase as
you only have a simple dot product to calculate rather than the more
complex polygonal intersection tests.
--
Justin Couch Author, Java Hacker
http://www.vlc.com.au/~justin/ Java 3D FAQ Maintainer
http://www.j3d.org/ J3D.org The Java 3D Community Site
-------------------------------------------------------------------
"Humanism is dead. Animals think, feel; so do machines now.
Neither man nor woman is the measure of all things. Every organism
processes data according to its domain, its environment; you, with
all your brains, would be useless in a mouse's universe..."
- Greg Bear, Slant
-------------------------------------------------------------------
===========================================================================
To unsubscribe, send email to [EMAIL PROTECTED] and include in the body
of the message "signoff JAVA3D-INTEREST". For general help, send email to
[EMAIL PROTECTED] and include in the body of the message "help".
