Skip to main content
SpringerLink
Log in

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Dpto. de Matemática e Informática, E.T.S.I. de Caminos, Ciudad Universitaria, 28040-, Madrid, Spain

    B. Llanas, M. Fernandez De Sevilla & V. Feliu

  2. Dpto. de Ingeniería Eléctrica, E.T.S.I Industriales, Campus Universitario s/n, 13071-, Ciudad Real, Spain

    B. Llanas, M. Fernandez De Sevilla & V. Feliu

Authors
  1. B. Llanas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Fernandez De Sevilla
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. Feliu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Llanas, B., Fernandez De Sevilla, M. & Feliu, V. Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition. Journal of Global Optimization 26, 361–385 (2003). https://doi.org/10.1023/A:1024755315702

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024755315702

Search

Navigation