✦ LIBER ✦

Visibility Queries and Maintenance in Simple Polygons

✍ Scribed by Aronov; Guibas; Teichmann; Zhang

Publisher: Springer
Year: 2002
Tongue: English
Weight: 212 KB
Volume: 27
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-001-0089-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An addendum to parallel methods for visi

An addendum to parallel methods for visibility and shortest-path problems in simple polygons

✍ Michael T. Goodrich; Steven B. Shauck; Sumanta Guha 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 75 KB

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

A note on the combinatorial structure of

A note on the combinatorial structure of the visibility graph in simple polygons

✍ L. Prasad; S.S. Iyengar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 954 KB

Hierarchical Decompositions and Circular

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons

✍ Siu-Wing Cheng; Otfried Cheong; Hazel Everett; René van Oostrum 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 204 KB

Minimizing the Size of Vertexlights in S

Minimizing the Size of Vertexlights in Simple Polygons

✍ Andreas Spillner; Hans-Dietrich Hecker 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB

We show that given a simple Polygon P it is NP-hard to determine the smallest α ∈ [0, π] such that P can be illuminated by α-vertexlights, if we place exactly one αvertexlight in each vertex of P .