An Accurate Distance-Calculation Algorithm for Convex Polyhedra

Eva Dyllong (), Wolfram Luther () and Werner Otten ()
Additional contact information
Eva Dyllong: Gerhard-Mercator-Universität-GH Duisburg, Informatik II
Wolfram Luther: Gerhard-Mercator-Universität-GH Duisburg, Informatik II
Werner Otten: Gerhard-Mercator-Universität-GH Duisburg, Informatik II

A chapter in Developments in Reliable Computing, 1999, pp 241-253 from Springer

Abstract: 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.

Keywords: Convex Polyhedron; Plane Supporting; Hierarchical Representation; Perpendicular Bisector; Original Vertex (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-017-1247-7_19

Ordering information: This item can be ordered from
http://www.springer.com/9789401712477

DOI: 10.1007/978-94-017-1247-7_19

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().