OTHER
Verified Distance Computation Between Convex Hulls of Octrees Using Interval Optimization Techniques
Eva Dyllong, Stefan Kiel
- Year
- 2010
- Citations
- 4
- Access
- Open access
Abstract
Abstract Distance computation is an important task in many application areas, including biomechanics, robot systems and computer games. Depending on the intended use, requirements differ. For example, in a medical context, a verified result may be of interest. In this paper we will demonstrate the use of an interval optimization algorithm for computing a verified enclosure of the minimum distance between the convex hulls of two octrees. We will also discuss runtime improvements. (© 2010 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Keywords
Convex hullComputationContext (archaeology)Interval arithmeticComputer scienceInterval (graph theory)RobotMathematical optimizationRegular polygonSet (abstract data type)
Related papers
OTHER
📊 26,957 cites
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 cites
Artificial intelligence: a modern approach
1995
OTHER
Open access📊 20,501 cites
Fractional Differential Equations
Igor Podlubný
2025
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991