✦ LIBER ✦

A linear time algorithm for minimum link paths inside a simple polygon

✍ Scribed by Subhash Suri

Publisher: Elsevier Science
Year: 1986
Weight: 827 KB
Volume: 35
Category: Article
ISSN: 0734-189X
DOI: 10.1016/0734-189x(86)90127-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for minimum link

A linear time algorithm for minimum link paths inside a simple polygon

✍ Subhash Suri 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 93 KB

Finding an approximate minimum-link visi

Finding an approximate minimum-link visibility path inside a simple polygon

✍ Muhammad H Alsuwaiyel; D.T Lee 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 433 KB

A simple linear expected time algorithm

A simple linear expected time algorithm for finding a hamilton path

✍ Andrew Thomason 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Discrete Mathematics 75 (1989) 373-379 North-Holland n?", so the problem is one of finding a fast algorithm which works on all graphs in %(n, p) except for a proportion somewhat smaller than 2~". This will be our algorithm A2. A very fast algorithm, which works on most graphs but not on as many as A

A linear-time algorithm for solving the

A linear-time algorithm for solving the strong hidden-line problem in a simple polygon

✍ Godfried T. Toussaint 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 201 KB

A simple linear-time algorithm for findi

A simple linear-time algorithm for finding path-decompositions of small width

✍ Kevin Cattell; Michael J. Dinneen; Michael R. Fellows 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 601 KB

A simple linear hidden-line algorithm fo

A simple linear hidden-line algorithm for star-shaped polygons

✍ David Rappaport; Godfried T Toussaint 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 287 KB