✦ LIBER ✦

Minimum vertex distance between separable convex polygons

✍ Scribed by Francis Chin; Cao An Wang

Book ID: 113162684
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 427 KB
Volume: 18
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(84)90073-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the minimum distance between two

Finding the minimum distance between two convex polygons

✍ Jacob T. Schwartz 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 451 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

On Distinct Distances from a Vertex of a

On Distinct Distances from a Vertex of a Convex Polygon

✍ Adrian Dumitrescu 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 126 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

Computing the extreme distances between

Computing the extreme distances between two convex polygons

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

Pseudo minimum translational distance be

Pseudo minimum translational distance between convex polyhedra (II)

✍ Xiangyang Zhu; Han Ding; Youlun Xiong 📂 Article 📅 2001 🏛 SP Science China Press 🌐 English ⚖ 691 KB