Verified Distance Computation Between Convex Hulls of Octrees Using Interval Optimization Techniques
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...
Gespeichert in:
| Veröffentlicht in: | Proceedings in applied mathematics and mechanics 2010-12, Vol.10 (1), p.651-652 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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) |
|---|---|
| ISSN: | 1617-7061 1617-7061 |
| DOI: | 10.1002/pamm.201010318 |