A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Incremental penetration depth estimation between convex polytopes using dual-space expansion
2004
IEEE Transactions on Visualization and Computer Graphics
We present a fast algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a "locally optimal solution" by walking on the surface of the Minkowski sums. The surface of the Minkowski sums is computed implicitly by constructing a local dual mapping on the Gauss map. We also present three heuristic techniques that are used to estimate the initial features used by the walking algorithm. We have implemented the algorithm and compared its
doi:10.1109/tvcg.2004.1260767
pmid:15384640
fatcat:2zhxfdy32zhizgjtcyo6unitvq