A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure
DOI10.1007/S00607-011-0161-0zbMATH Open1238.65037OpenAlexW2028291049MaRDI QIDQ411447FDOQ411447
Authors: E. Dyllong, Stefan Kiel 
Publication date: 4 April 2012
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-011-0161-0
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
numerical examplesalgorithminterval arithmeticKlein bottlehierarchical decompositionverified computationdistance computationimplicit objects
Cites Work
- Numerical Software with Result Verification
- Foundations of multidimensional and metric data structures.
- Interval Methods for Systems of Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- The cluster problem in multivariate global optimization
- Distance Computation from an Ellipsoid to a Linear or a Quadric Surface in IR n
- The GJK distance algorithm: an interval version for incremental motions
- An accurate distance algorithm for octree-encoded objects
- Verified spatial subdivision of implicit objects using implicit linear interval estimations
- Title not available (Why is that?)
- A heuristic rejection criterion in interval global optimization algorithms
Cited In (2)
Uses Software
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)
