HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

A Fast Method for Local Penetration Depth Computation

Abstract : This paper presents a fast method for determining an approximation of the local penetration information for intersecting polyhedral models. As opposed to most techniques, this algorithm requires no specific knowledge of the object's geometry or topology, or any pre-processing computations. In order to achieve real-time performance even for complex, nonconvex models, we decouple the computation of the local penetration directions from the computation of the corresponding local penetration depths: for any pair of intersecting objects, we partition the penetrating zones into coherent regions, and we determine for each of these regions a local penetration direction. Then, for each of these regions, we estimate a local penetration depth in the previously computed penetration direction. This method has been implemented and tested on a 2.0 GHz Pentium PC with a NVIDIA GeForce FX 5900 graphics card with AGP 4× and 768MB of RAM. The examples indicate that a meaningful local penetration information can be computed for complex models and challenging intersection scenarios within a few milliseconds.
Document type :
Journal articles
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

Contributor : Nano-D Equipe Connect in order to contact the contributor
Submitted on : Tuesday, June 2, 2009 - 12:02:17 AM
Last modification on : Monday, August 16, 2021 - 2:36:03 PM
Long-term archiving on: : Friday, June 11, 2010 - 12:08:13 AM


Files produced by the author(s)




Stephane Redon, Ming Lin. A Fast Method for Local Penetration Depth Computation. Journal of graphics tools, A.K. Peters, Ltd., 2006, 11 (2), pp.37-50. ⟨10.1080/2151237X.2006.10129216⟩. ⟨inria-00390349⟩



Record views


Files downloads