A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure
From MaRDI portal
(Redirected from Publication:411447)
Recommendations
- Verified convex hull and distance computation for octree-encoded objects
- scientific article; zbMATH DE number 1440920
- Numerical Software with Result Verification
- An accurate distance-calculation algorithm for convex polyhedra
- Verified spatial subdivision of implicit objects using implicit linear interval estimations
Cites work
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 1408651 (Why is no real title available?)
- A heuristic rejection criterion in interval global optimization algorithms
- An accurate distance algorithm for octree-encoded objects
- Distance Computation from an Ellipsoid to a Linear or a Quadric Surface in IR n
- Foundations of multidimensional and metric data structures.
- Interval Methods for Systems of Equations
- Numerical Software with Result Verification
- The GJK distance algorithm: an interval version for incremental motions
- The cluster problem in multivariate global optimization
- Verified spatial subdivision of implicit objects using implicit linear interval estimations
Cited in
(2)
This page was built for publication: A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411447)