Abstract
We introduce polar visibility graphs, graphs whose vertices can be represented by arcs of concentric circles with adjacency determined by radial visibility including visibility through the origin. These graphs are more general than the well-studied bar-visibility graphs and are characterized here, when arcs are proper subsets of circles, as the graphs that embed on the plane with all but at most one cut-vertex on a common face or on the projective plane with all cut-vertices on a common face. We also characterize the graphs representable using full circles and arcs.
Research supported in part by NSA Grant #MDA904-99-1-0069.
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.): Proc. Graph Drawing’ 96. Lecture Notes in Computer Science, Vol. 1190. Springer, Berlin (1997) 25–44
Chang, Y-W., Jacobson, M. S., Lehel, J., West, D. B.: The visibility number of a graph (preprint)
Dean, A., Hutchinson, J.: Rectangle-visibility representations of bipartite graphs. Discrete Applied Math. 75 (1997) 9–25
_____, Rectangle-visibility layouts of unions and products of trees, J. Graph Algorithms and Applications 2 (1998) 1–21
Dean, A.: Bar-visibility graphs on the Möbius Band. In: Marks, J. (ed.): Proc. Graph Drawing 2000. (to appear)
Hutchinson, J., Shermer, T., Vince, A.: On Representations of some Thickness-two graphs. Computational Geometry, Theory and Applications 13 (1999) 161–171
Mohar, B.: Projective planarity in linear time. J. Algorithms 15 (1993) 482–502
Mohar, B., Rosenstiehl, P.: Tessellation and visibility representations of maps on the torus. Discrete Comput. Geom. 19 (1998) 249–263
Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins Press (to appear)
O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)
Tamassia, R., Tollis, I. G.: A unified approach to visibility representations of planar graphs. Discrete and Computational Geometry 1 (1986) 321–341
____: Tesselation representations of planar graphs. In: Medanic, J. V., Kumar, P. R. (eds.): Proc. 27th Annual Allerton Conf. on Communication, Control, and Computing. (1989) 48–57
____: Representations of graphs on a cylinder. SIAM J. Disc. Math. 4 (1991) 139–149
Thomassen, C.: Planar representations of graphs. In: Bondy, J. A., Murty, U. S. R. (eds.): Progress in Graph Theory. (1984) 43–69
West, D.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River, NJ (1996)
White, A.: Graphs, Groups and Surfaces. revised ed. North-Holland, Amsterdam (1984)
Wismath, S.: Characterizing bar line-of-sight graphs. In: Proc. 1st Symp. Comp. Geom. ACM (1985) 147–152
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hutchinson, J.P. (2001). On Polar Visibility Representations of Graphs. In: Marks, J. (eds) Graph Drawing. GD 2000. Lecture Notes in Computer Science, vol 1984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44541-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-44541-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41554-1
Online ISBN: 978-3-540-44541-8
eBook Packages: Springer Book Archive