MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Combined algorithm (1997) [1 citations — 0 self]

Download:
Download as a PDF
by Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dinesh Manocha
of ETRI, FUB and UH on core experiment N2 on automatic segmentation of moving objects”. Doc. ISO/IEC JTC1/SC29/WG11 MPEG97/m2383
http://www.cs.unc.edu/~youngkim/publication/SCA02.pdf
Add To MetaCart

Abstract:

We present a novel and fast algorithm to compute penetration depth (PD) between two polyhedral models for physically-based animation. Given two overlapping polyhedra, it computes the minimal translation distance to separate them using a combination of objectspace and image-space techniques. The algorithm computes pairwise Minkowski sums of decomposed convex pieces and performs a closest point query using rasterization hardware. It uses bounding volume hierarchies, object-space and image-space culling algorithms to further accelerate the computation and refines the estimated PD in a hierarchical manner. We demonstrate its application to contact response computation and a time-stepping method for dynamic simulation.

Citations

505 OBB-tree: A hierarchical structure for rapid interference detection – GOTTSCHALK, LIN, et al. - 1996
226 A Fast Procedure for Computing the Distance Between Complex Objects in Three Space – Gilbert, Keerthi - 1987
224 The Quickhull algorithm for convex hulls – Barber, Dobkin, et al. - 1996
175 Collision Detection and Response for Computer Animation – MOORE, WILHELMS - 1988
166 Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs – Klosowski, Mitchell, et al. - 1998
142 Collision detection for interactive graphics applications – Hubbard - 1995
140 V-clip: Fast and robust polyhedral collision detection – Mirtich - 1998
139 Fast contact force computation for nonpenetrating rigid bodies – BARAFF - 1994
124 Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware – Hoff, Culver, et al. - 1999
112 Impulse-based simulation of rigid bodies – MIRTICH, CANNY - 1995
97 Enhancing GJK: Computing minimum and penetration distances between convex polyhedra – Cameron - 1997
85 Six degree-of-freedom haptic rendering using voxel sampling – McNeely, Puterbaugh, et al. - 1999
77 Solid-interpolating deformations: Construction and animation of PIPs – Kaul, Rossignac - 1991
76 Efficient algorithms for incremental distance computation – LIN, CANNY - 1991
68 Accurate and fast proximity queries between polyhedra using convex surface decomposition – Ehmann, Lin - 2001
63 An Implicit Time-Stepping Scheme for Rigid Body Dynamics with – Stewart, Trinkle
59 Dynamic Simulation of Autonomous Legged Locomotion – McKenna, Zeltzer - 1990
55 Computing convolutions by reciprocal search – Guibas, Seidel - 1987
44 Determining the minimum translational distance between two convex polyhedra – Cameron, Culley - 1986
44 Computing the intersection-depth of polyhedra – Dobkin, Hershberger, et al. - 1993
33 Strategies for polyhedral surface decomposition: an experimental study. Computational Geometry: Theory and Applications – Chazelle, Dobkin, et al. - 1997
33 Interactive inspection of solids: cross-sections and interferences – Rossignac, Megahed, et al. - 1992
31 Timewarp rigid body simulation – MIRTICH - 2000
20 Penetration depth of two convex polytopes in 3d – Agarwal, Har-Peled, et al. - 2002
20 Interactive rendering of CSG models – Wiegand - 1996
16 Deformed distance fields for simulation of non-penetrating flexible bodies – Fisher, Lin - 2001
16 Fast constructive-solid geometry display in the Pixel-Powers graphics system – Goldfeather, Hultquist, et al. - 1986
15 Growth distances: New measures for object separation and penetration – Ong, Gilbert - 1996
14 Z-buffer rendering from CSG: The Trickle algorithm – EPSTEIN, JANSEN, et al. - 1989
14 Fast and simple geometric proximity queries using graphics hardware – Hoff, Zaferakis, et al. - 2001
11 Dynamic simulation of non-penetrating rigid body simulation – Baraff - 1992
11 DEEP: Dual-space expansion for estimating penetration depth between convex polytopes – Kim, Lin, et al. - 2002
11 Fast penetration depth computation using rasterization hardware and hierarchical refinement – Kim, Otaduy, et al. - 2002
8 Proximity queries and penetration depth computation on 3D game objects. Game Developers Conference – Bergen - 2001
8 6-dof haptic display of polygonal models – GREGORY, MASCARENHAS, et al. - 2000
6 The magic of the Z-buffer: A survey – Theoharis, Papaiannou, et al. - 2001