✦ LIBER ✦

An optimal visibility graph algorithm for triangulated simple polygons

✍ Scribed by John Hershberger

Publisher: Springer
Year: 1989
Tongue: English
Weight: 973 KB
Volume: 4
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01553883

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Triangulations, visibility graph and ref

Triangulations, visibility graph and reflex vertices of a simple polygon

✍ F. Hurtado; M. Noy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 1020 KB

An optimal algorithm for finding the edg

An optimal algorithm for finding the edge visibility polygon under limited visibility

✍ Sung-Ho Kim; Jung-Heum Park; Seung-Hak Choi; Sung Yong Shin; Kyung-Yong Chwa 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 608 KB

A fast las vegas algorithm for triangula

A fast las vegas algorithm for triangulating a simple polygon

✍ Kenneth L. Clarkson; Robert E. Tarjan; Christopher J. Wyk 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 572 KB

A P-Completeness Result for Visibility G

A P-Completeness Result for Visibility Graphs of Simple Polygons

✍ Jana Dietel; Hans-Dietrich Hecker 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

A Randomized Algorithm for Triangulating

A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time

✍ N. M. Amato; M. T. Goodrich; E. A. Ramos 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 220 KB

A Simple Linear Time Algorithm for Trian

A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs

✍ H. Bodlaender; T. Kloks 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 560 KB

In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the perfect phylogeny problem from molecular biology and is strongly related with the problem of recog