✦ LIBER ✦

Visibility graphs of towers

✍ Scribed by Paul Colley; Anna Lubiw; Jeremy Spinrad

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 813 KB
Volume: 7
Category: Article
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00033-x

No coin nor oath required. For personal study only.

✦ Synopsis

A tower is a polygon consisting of two reflex chains sharing one common endpoint, together with one edge joining the other endpoints of the chains. A linear time algorithm is given to recognize the [vertex] visibility graphs of towers, and these graphs are characterized as bipartite permutation graphs with an added Hamiltonian cycle. Similar results have been obtained independently by Choi, Shin and Chwa (1992).

📜 SIMILAR VOLUMES

Minimal visibility graphs

✍ Douglas Campbell; John Higgins 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 583 KB

Minimal tangent visibility graphs

✍ Michel Pocchiola; Gert Vegter 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 881 KB

A General Notion of Visibility Graphs

✍ Develin; Hartke; Moulton 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 106 KB

A note on visibility graphs

✍ F Luccio; S Mazzone; C.K Wong 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 602 KB

Given a set S = {s 1, s 2, ..., s,,) of vertical line segments, si, sj see each other ff there is a horizontal line segment which intersects them, but does not intersect any other line segment between them. A ws" ibility graph G of vertices {vl, v2, • .., v,,} is put into a one-to-one correspondenc

Some results on visibility graphs

✍ Thomas Andreae 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 897 KB

Visibility Graphs and Oriented Matroids

✍ Abello; Kumar 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 133 KB