Abstract
The paper describes an efficient and accurate algorithm to calculate the distance between convex polyhedra. The closest points between two objects can be calculated by simple projections and can be followed continuously in time. The polyhedra are given by the vertices. Interval data are supported. The accuracy of the calculation is explored.
This work was supported by the Deutsche Forschungsgemeinschaft within the scope of the project A8 of the Sonderforschungsbereich 291.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bobrow, J. E.: A Direct Minimization Approach for Obtaining the Distance Between Convex Polyhedra, The International Journal of Robotics Research 8 (3) (1989), pp. 65–76.
Chen, Liang, Huang, Wen Qi, and Song, En Min: A Fast Algorithm for Computing the Distance between Two Convex Polyhedra, Math. J. Chinese Univ. 16 (4) (1994), pp. 345–359.
Dobkin, D. and Kirkpatrick, D.: Determining the Separation of Preprocessed Polyhedra—A Unified Approach, in: Automata, Languages and Programming (Coventry, 1990), Lecture Notes in Computer Science 443, Springer, New York, 1990, pp. 400–413.
Dobkin, D., Hershberger, J., Kirkpatrick, D., and Suri, S.: Computing the Intersection-Depth of Polyhedra, Algorithmica 9 (6) (1993), pp. 528–533.
Edelsbrunner, H.: Algorithms in Combinatorial Geometry, Springer, Berlin, 1987.
Gilbert, E. G., Johnson, D. W., and Keerthi S. S.: A Fast Procedure for Computing the Distance Between Complex Objects in Three-Dimensional Space, IEEE Journal of Robotics and Automation 4 (2) (1988), pp. 193–203.
Kulisch, U. (Hrsg.): Wissenschaftliches Rechnen mit Ergebnisverifikation—Eine Einführung, Akademie-Verlag Berlin und Vieweg-Verlag Wiesbaden, 1989.
Quinlan, S.: Efficient Distance Computation Between Non-Convex Objects, in: IEEE Intern. Conf. on Robotics and Automation,1994, pp. 3324–3329.
Sato, Y., Hirata, M., Maruyama, T., and Arita, Y.: Efficient Collision Detection Using Fast Distance-Calculation Algorithms for Convex and Non-Convex Objects, in: Proc. IEEE Intern. Conf. on Robotics and Automation, Minneapolis, Minnesota, 1996, pp. 771–778.
Werner, K.: Verifizierte Berechnung der inversen Weierstraß-Funktion und der elliptischen Funktion von Jacobi in beliebigen Maschinenarithmetiken, PhD-Thesis, Duisburg, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Dyllong, E., Luther, W., Otten, W. (1999). An Accurate Distance-Calculation Algorithm for Convex Polyhedra. In: Csendes, T. (eds) Developments in Reliable Computing. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1247-7_19
Download citation
DOI: https://doi.org/10.1007/978-94-017-1247-7_19
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5350-3
Online ISBN: 978-94-017-1247-7
eBook Packages: Springer Book Archive