Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Orderly spanning trees with applications to graph encoding and graph drawing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer
SIAM Journal on Discrete Mathematics
Improved visibility representation of plane graphs
Computational Geometry: Theory and Applications
Hi-index | 0.89 |
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 [Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comput. Geom. 1 (1986) 343], Tamassia and Tollis [An unified approach to visibility representations of planar graphs, Discrete Comput. Geom. 1 (1986) 321] independently gave linear time VR algorithms for 2-connected plane graph. Afterwards, one of the main concerns for VR is the size of the representation. In this paper, we prove that any plane graph G has a VR with height bounded by ⌊5n/6⌋. This improves the previously known bound ⌊15n/16⌋. We also construct a plane graph G with n vertices where any VR of G requires a size of (⌊2n/3⌋) × (⌊4n/3⌋ - 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 [G. Kant, A more compact visibility representation, Internat. J. Comput. Geom. Appl. 7 (1997) 197].