Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition
نویسندگان
چکیده
منابع مشابه
Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition
The need to perform fast and accurate proximity queries arises frequently in physically-based modeling, simulation, animation, real-time interaction within a virtual environment, and game dynamics. The set of proximity queries include intersection detection, tolerance verification, exact and approximate minimum distance computation, and (disjoint) contact determination. Specialized data structu...
متن کاملAccelerated proximity queries between convex polyhedra by multi-level Voronoi marching
We present an accelerated proximity query algorithm between moving convex polyhedra. The algorithm combines Voronoi-based feature tracking with a multi-levelof-detail representation, in order to adapt to the variation in levels of coherence and speed up the computation. It provides a progressive refinement framework for collision detection and distance queries. We have implemented our algorithm...
متن کاملConvex Decomposition of Polyhedra and Robustness
We present a simple algorithm to compute a convex decomposition of a non-convex, non-manifold polyhedron of arbitrary genus (handles). The algorithm takes a non-convex polyhedron with n edges and r notches (features causing non-convexity in the polyhedra) and produces a worst-case optimal O(r2 ) number of convex polyhedra Si, with U;S; = S, in O(nr2 ) time and O(nr) space. Recenlly, Chazelle an...
متن کاملFeature-based Surface Decomposition for Correspondence and Morphing Between Polyhedra
We present a new approach for establishing correspondence between two homeomorphic 3D polyhedral models. The user can specify corresponding feature pairs on the polyhedra with a simple and intuitive interface. Based on these features, our algorithm decomposes the boundary of each polyhedron into the same number of morphing patches. A 2D mapping for each morphing patch is computed in order to me...
متن کاملFast approximate convex decomposition using relative concavity
Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2001
ISSN: 0167-7055,1467-8659
DOI: 10.1111/1467-8659.00543