Bounding Volume Hierarchies for Collision Detection

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
3,246
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Aug 9, 2007

Bounding Volume Hierarchy for Generalized Collision Detection.
November 2006.

Category:

Science & Technology

Tags:

License:

Standard YouTube License

  • likes, 0 dislikes

Link to this comment:

Share to:

Uploader Comments (dlmtavar)

  • Excellent demo! I have not looked up stats on either of the methods you have shown, but from what I can see the OBB tree method looks most optimal. But concerning speed, would the AABB method be the fastest or the Sphere method?

  • Thanks...

    OBB Trees are more expensive to build than Hierarchies of Spheres or AABB Trees. Also, the implementation is more complex and the overlap tests is expensive.

    However, OBB Trees can bound geometry more tightly than AABBTrees and sphere trees, by virtue of their variable orientation. This imply that OBBTrees require symptotically fewer box tests than AABBTrees.

    So, i prefer OBBTrees to make detection between polygonal model.

see all

All Comments (2)

Sign In or Sign Up now to post a comment!
  • good

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more