✦ LIBER ✦

Motion Planning for a Convex Polygon in a Polygonal Environment

✍ Scribed by P. K. Agarwal; B. Aronov; M. Sharir

Publisher: Springer
Year: 1999
Tongue: English
Weight: 344 KB
Volume: 22
Category: Article
ISSN: 0179-5376
DOI: 10.1007/pl00009455

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new linear algorithm for intersecting

A new linear algorithm for intersecting convex polygons

✍ Joseph O'Rourke; Chi-Bin Chien; Thomas Olson; David Naddor 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 520 KB

A new linear algorithm for intersecting

A new linear algorithm for intersecting convex polygons

✍ Joseph O'Rourke; Chi-Bin Chien; Thomas Olson; David Naddor 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 82 KB

A simple linear algorithm for intersecti

A simple linear algorithm for intersecting convex polygons

✍ Godfried T. Toussaint 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 456 KB

A counter-example to a convex hull algor

A counter-example to a convex hull algorithm for polygons

✍ Godfried Toussaint 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 161 KB

On the time complexity for circumscribin

On the time complexity for circumscribing a convex polygon

✍ Tony C. Woo; Hyun-Chan Lee 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 120 KB

On the time complexity for circumscribin

On the time complexity for circumscribing a convex polygon

✍ Tony C Wood; Hyun-Chan Lee 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 68 KB

A recent article "Circumscribing a Convex Polygon by a Polygon of Fewer Sides with Minimal Area Addition" by Dori and Ben-Bassat, Comput. Vision Graph. Image Process. 24, 1983, 131-159, raised several interesting questions including the time complexity of their algorithm. In this paper, the time com