[ODE] dSpaceCollide2 and Collision Space Sorting

[Jon Watte]

I think a better strategy would be to set the collider bits, so that 
no static geom will be tested against any other static geom, and then 
use dSpaceCollide() inside a single hash space.

Cheers,

			/ h+


-----Original Message-----
From: ode-bounces at q12.org [mailto:ode-bounces at q12.org]On Behalf Of Donny
Viszneki
Sent: Friday, November 05, 2004 9:25 PM
To: ode at q12.org
Subject: [ODE] dSpaceCollide2 and Collision Space Sorting


I am wondering how the optimizations of collision space sorting (from 
dHashSpace or dQuadTreeSpace) would be affected when colliding with two 
spaces together.

The reason I am wondering about this is because I have much more 
immutable geometry than mutable geometry, and thought I could save a 
LOT of time checking for collisions if I used dSpaceCollide2, having 
pre-organized all geometry into a group for immutable, and a group for 
mutable.

I would ASSUME that hashspace on hashspace action would experience no 
performance hit.


Thanks for your help.

_______________________________________________
ODE mailing list
ODE at q12.org
http://q12.org/mailman/listinfo/ode