Unit Bar-Visibility Layouts of Triangulated Polygons
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.
- 2.Chen, G., Keating, K.: Bar Visibility Graphs with Bounded Length (Preprint)Google Scholar
- 3.Dean, A., Evans, W., Gethner, E., Laison, J., Safari, M., Trotter, T.: Bar k-Visibility Graphs (in preparation) (2004)Google Scholar
- 4.Dean, A., Gethner, E., Hutchinson, J.: A Characterization of Triangulated Polygons that are Unit Bar-Visibility Graphs (in preparation) (2004)Google Scholar
- 10.Shermer, T.: On rectangle visibility graphs III, external visibility and complexity. In: Proc. 8th Canadian Conf. on Computational Geometry, pp. 234–239 (1996)Google Scholar
- 13.Wismath, S.: Characterizing Bar Line-of-Sight Graphs. In: Proc. 1st ACM Symp. Computational Geometry, pp. 147–152 (1985)Google Scholar