Abstract
In a visibility representation (VR for short) of a plane graph G, each vertex of G is represented by a horizontal line segment such that the line segments representing any two adjacent vertices of G are joined by a vertical line segment. Rosenstiehl and Tarjan [6], Tamassia and Tollis [7] independently gave linear time VR algorithms for 2-connected plane graph. Afterwards, one of the main concerns for VR is the size of VR. In this paper, we prove that any plane graph G has a VR with height bounded by \(\lfloor \frac{5n}{6} \rfloor\). This improves the previously known bound \(\lceil \frac{15n}{16} \rceil\). We also construct a plane graph G with n vertices where any VR of G require a size of \((\lfloor \frac{2n}{3} \rfloor) \times (\lfloor \frac{4n}{3} \rfloor-3)\). Our result provides an answer to Kant’s open question about whether there exists a plane graph G such that all of its VR require width greater that cn, where c > 1.
Research supported in part by NSF Grant CCR-0309953.
Chapter PDF
Similar content being viewed by others
References
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41–51 (1990)
Kant, G.: A more compact visibility representation. International Journal of Computational Geometry and Applications 7, 197–210 (1997)
Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science 172, 175–193 (1997)
Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs, Rome, pp. 215–232 (1967)
Lin, C.-C., Lu, H.-I., Sun, I.-F.: Improved compact visibility representation of planar graph via Schnyder’s realizer. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 14–25. Springer, Heidelberg (2003)
Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1, 343–353 (1986)
Tamassia, R., Tollis, I.G.: An unified approach to visibility representations of planar graphs. Discrete Comput. Geom. 1, 321–341 (1986)
Zhang, H., He, X.: Compact visibility representation and straight-line grid embedding of plane graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 493–504. Springer, Heidelberg (2003)
Zhang, H., He, X.: On visibility representation of plane graphs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 477–488. Springer, Heidelberg (2004)
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
Zhang, H., He, X. (2005). New Theoretical Bounds of Visibility Representation of Plane Graphs. 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_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_43
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)