✦ LIBER ✦

Minimum polygonal separation

✍ Scribed by H. Edelsbrunner; F.P. Preparata

Book ID: 113383883
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 898 KB
Volume: 77
Category: Article
ISSN: 0890-5401
DOI: 10.1016/0890-5401(88)90049-1

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

The complexity of computing minimum sepa

The complexity of computing minimum separating polygons

✍ Peter Eades; David Rappaport 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Minimum area circumscribing Polygons

✍ Alok Aggarwal; J. S. Chang; Chee K. Yap 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 481 KB

Minimum-Perimeter Intersecting Polygons

✍ Adrian Dumitrescu; Minghui Jiang 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 516 KB

Minimum K-partitioning of rectilinear po

Minimum K-partitioning of rectilinear polygons

✍ Oliver Gunther 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 941 KB

A minimum k-partition decomposes a rectilinear polygon with n vertices into a minimum number of disjoint rectilinear components with no more than k vertices each (k < n). First, we derive a new lower bound for the number of components in a kpartition. Then we present algorithms to compute minimum k-

Recursive computation of minimum-length

Recursive computation of minimum-length polygons

✍ Klette, Gisela 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 625 KB