|
|||||
|
|
Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition |
|
| Authors: | B. Llanas M. Fernandez De Sevilla V. Feliu |
| Affiliation: | (1) Dpto. de Matemática e Informática, E.T.S.I. de Caminos, Ciudad Universitaria, 28040- Madrid, Spain;(2) Dpto. de Ingeniería Eléctrica, E.T.S.I Industriales, Campus Universitario s/n, 13071- Ciudad Real, Spain |
| Abstract: | The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large. |
| Keywords: | Distance between convex polyhedra Local descent Projection algorithms Sufficient condition of global minimum |
| 本文献已被 SpringerLink 等数据库收录！ | |