✦ LIBER ✦

Finding the minimum distance between two convex polygons

✍ Scribed by Jacob T. Schwartz

Book ID: 113162329
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 451 KB
Volume: 13
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(81)90051-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum vertex distance between separabl

Minimum vertex distance between separable convex polygons

✍ Francis Chin; Cao An Wang 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 427 KB

Computing the extreme distances between

Computing the extreme distances between two convex polygons

✍ H Edelsbrunner 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 605 KB

An optimal algorithm for computing the m

An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons

✍ G. T. Toussaint 📂 Article 📅 1984 🏛 Springer Vienna 🌐 English ⚖ 374 KB

Unit distances between vertices of a con

Unit distances between vertices of a convex polygon

✍ P.C. Fishburn; J.A. Reeds 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 600 KB

Fishburn, P.C. and J.A. Reeds, Unit distances between vertices of a convex polygon, Computational Geometry: Theory and Applications 2 (1992) 81-91. Many years ago Danzer resolved an open question of ErdGs by constructing a convex 9-gon, each vertex of which has the same distance to three other verti

Minimum Distance Between the Faces of Tw

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

✍ B. Llanas; M. Fernandez De Sevilla; V. Feliu 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 196 KB

The distance between two convex sets

✍ Achiya Dax 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 498 KB