0

Is there a faster algorithm for collision detection? I'd like to use it find the collision pairs of model in a building.

There is a related post:Best algorithm for efficient collision detection between objects.

Is there any ready-to-used library? BTW:The 3d object is in obj format.

3
  • Are you using some kond of engine? Which programming language? Commented Oct 16, 2015 at 5:41
  • I prefer java, and am learning jmonkey engine. Commented Oct 16, 2015 at 8:48
  • From wiki.jmonkeyengine.org/doku.php/… ----- Assume you have two collidables a and b and want to detect collisions between them. The collision parties can be Geometries, Nodes with Geometries attached (including the rootNode), Planes, Quads, Lines, or Rays. An important restriction is that you can only collide geometry vs bounding volumes or rays. (This means for example that a must be of Type Node or Geometry and b respectively of Type BoundingBox, BoundingSphere or Ray.) ----- It seems collision between two geometry is not supported. Commented Oct 16, 2015 at 8:54

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.