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 metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/inria-00390349
Contributor : Nano-D Equipe <>
Submitted on : Tuesday, June 2, 2009 - 12:02:17 AM
Last modification on : Monday, March 21, 2016 - 5:28:12 PM
Long-term archiving on : Friday, June 11, 2010 - 12:08:13 AM

File

JGT2006.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

165

Files downloads

482