Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bose, P., Dean, A., Hutchinson, J., Shermer, T.: On rectangle visibility graphs. In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 25–44. Springer, Heidelberg (1997)
Chen, G., Keating, K.: Bar Visibility Graphs with Bounded Length (Preprint)
Dean, A., Evans, W., Gethner, E., Laison, J., Safari, M., Trotter, T.: Bar k-Visibility Graphs (in preparation) (2004)
Dean, A., Gethner, E., Hutchinson, J.: A Characterization of Triangulated Polygons that are Unit Bar-Visibility Graphs (in preparation) (2004)
Dean, A., Hutchinson, J.: Rectangle-visibility layouts of unions and products of trees. J. Graph Alg. and App. 2, 1–21 (1998)
Dean, A., Hutchinson, J.: Rectangle-visibility representations of bipartite graphs. Disc. App. Math. 75, 9–25 (1997)
Dean, A., Veytsel, N.: Unit bar-visibility graphs. Congressus Numerantium 160, 161–175 (2003)
Hutchinson, J., Shermer, T., Vince, A.: On representations of some thickness two graphs. Computational Geometry, Theory and Applications 13, 161–171 (1999)
Rosenstiehl, P., Tarjan, R.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1, 343–353 (1986)
Shermer, T.: On rectangle visibility graphs III, external visibility and complexity. In: Proc. 8th Canadian Conf. on Computational Geometry, pp. 234–239 (1996)
Streinu, I., Whitesides, W.: Rectangle visibility graphs: Characterization, construction, and compaction. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 26–37. Springer, Heidelberg (2003)
Tamassia, R., Tollis, I.: A Unified Approach to Visibility Representations of Planar Graphs. J. of Discrete and Computational Geometry 1, 321–341 (1986)
Wismath, S.: Characterizing Bar Line-of-Sight Graphs. In: Proc. 1st ACM Symp. Computational Geometry, pp. 147–152 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dean, A.M., Gethner, E., Hutchinson, J.P. (2005). Unit Bar-Visibility Layouts of Triangulated Polygons. In: Pach, J. (eds) Graph Drawing. GD 2004. Lecture Notes in Computer Science, vol 3383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24528-5
Online ISBN: 978-3-540-31843-9
eBook Packages: Computer ScienceComputer Science (R0)