Rectangle-visibility representations of bipartite graphs
Discrete Applied Mathematics
Characterizing bar line-of-sight graphs
SCG '85 Proceedings of the first annual symposium on Computational geometry
On representations of some thickness-two graphs
Computational Geometry: Theory and Applications
Rectangle Visibility Graphs: Characterization, Construction, and Compaction
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Rectangle Visibility Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
On Rectangle Visibility Graphs. III. External Visibility and Complexity
Proceedings of the 8th Canadian Conference on Computational Geometry
Thickness of bar 1-visibility graphs
GD'06 Proceedings of the 14th international conference on Graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
A triangulated polygon is a 2-connected maximal outerplanar graph. A unit bar-visibility graph (UBVG for short) is a graph whose vertices can be represented by disjoint, horizontal, unit-length bars in the plane so that two vertices are adjacent if and only if there is a non-degenerate, unobstructed, vertical band of visibility between the corresponding bars. We give combinatorial and geometric characterizations of the triangulated polygons that are UBVGs. To each triangulated polygon G we assign a character string with the property that G is a UBVG if and only if the string satisfies a certain regular expression. Given a string that satisfies this condition, we describe a linear-time algorithm that uses it to produce a UBV layout of G.