“Non convex mesh penetration distance for rigid body dynamics” by Teichmann and Liu

Conference:

SIGGRAPH 2003

Title:

Non convex mesh penetration distance for rigid body dynamics

Session/Category Title:   Surface Reconstruction

Presenter(s)/Author(s):

• Marek Teichmann
• Zhaoheng Liu

Abstract:

A new algorithm for finding the penetration distance between two non-convex meshes represented by bounding-volume trees.

References:

1. EHMANN, S. A., AND LIN, M. C. 2001. Accurate and fast proximity queries between polyhedra using convex surface decomposition. In EUROGRAPHICS, vol. 20.
2. GOTTSCHALK, S., LIN, M. C., AND MANOCHA, D. 1996. OBB-tree: A hierarchical structure for rapid interference detection. Comput. Graph. 30, 171–180. Proc. SIGGRAPH ’96.
3. LARSEN, E., GOTTSCHALK, S., LIN, M. C., AND MANOCHA, D. 2000. Fast proximity queries with swept sphere volumes. In Intl Conf. Robotics and Automation.
4. PAETH, A. W., Ed. 1995. Graphics Gems V. Academic Press, Boston, MA.

ACM Digital Library Publication:

Non convex mesh penetration distance for rigid body dynamics

Submit a story: