𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A General Notion of Visibility Graphs

✍ Scribed by Develin; Hartke; Moulton

Publisher
Springer
Year
2003
Tongue
English
Weight
106 KB
Volume
29
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on visibility graphs
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

Visibility graphs of towers
Visibility graphs of towers
✍ Paul Colley; Anna Lubiw; Jeremy Spinrad πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 813 KB

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 grap

A note on minimal visibility graphs
A note on minimal visibility graphs
✍ Xiaojun Shen; Qing Hu πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 60 KB
On the minimum size of visibility graphs
On the minimum size of visibility graphs
✍ Alfredo GarcΔ±́a Olaverri; Ferran Hurtado; Marc Noy; Javier Tejel πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 177 KB

In this paper we give tight lower bounds on the size of the visibility graph, the contracted visibility graph, and the barvisibility graph of n disjoint line segments in the plane, according to their vertex-connectivity.