An accurate distance-calculation algorithm for convex polyhedra
From MaRDI portal
Cited in
(18)- The gradient and the Hessian of the distance between point and triangle in 3D
- A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure
- Distance bound for nonconvex polyhedral models in close proximity
- Numerical Software with Result Verification
- On the application of accurate distance algorithms to multibody simulations
- OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS
- scientific article; zbMATH DE number 740451 (Why is no real title available?)
- scientific article; zbMATH DE number 1440920 (Why is no real title available?)
- Verified convex hull and distance computation for octree-encoded objects
- Computing distance using internal axis-aligned bounding-box for nearly intersected objects
- An accurate distance algorithm for octree-encoded objects
- scientific article; zbMATH DE number 1471509 (Why is no real title available?)
- scientific article; zbMATH DE number 3934326 (Why is no real title available?)
- An optimal algorithm for solving collision distance between convex polygons in plane
- The GJK distance algorithm: an interval version for incremental motions
- Efficient distance computation in configuration space
- Modelling geometric objects and tolerances with intervals: Data exchange with ISO standard STEP
- scientific article; zbMATH DE number 2202078 (Why is no real title available?)
This page was built for publication: An accurate distance-calculation algorithm for convex polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971077)