Abstract
We investigate open rectangle-of-influence drawings for irreducible triangulations, which are plane graphs with a quadrangular exterior face, triangular interior faces and no separating triangles. An open rectangle-of-influence drawing of a plane graph G is a type of straight-line grid drawing where there is no vertices drawn in the proper inside of the axis-parallel rectangle defined by the two end vertices of any edge. The algorithm presented by Miura and Nishizeki [8] uses a grid of size \({\cal W} + {\cal H} \leq\) (n-1), where \({\cal W}\) is the width of the grid, \({\cal H}\) is the height of the grid and n is the number of vertices in G. Thus the area of the grid is at most ⌈(n-1)/2⌉ × \(\lfloor\)(n-1)/2\(\rfloor\) [8].
In this paper, we prove that the two straight-line grid drawing algorithms for irreducible triangulations from [4] and quadrangulations from [3,5] actually produce open rectangle-of-influence drawings for them respectively. Therefore, the straight-line grid drawing size bounds from [3,4,5] also hold for the open rectangle-of-influence drawings. For irreducible triangulations, the new asymptotical grid size bound is \(\emph{11n/27}\) × \(\emph{11n/27}\). For quadrangulations, our asymptotical grid size bound \(\emph{13n/27}\) × \(\emph{13n/27}\) is the first known such bound.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonichon, N., Felsner, S., Mosbah, M.: Convex Drawings of 3-Connected Plane Graphs. Algorithmica 47, 399–420 (2007)
Chiba, N., Onoguchi, K., Nishizeki, T.: Drawing Planar Graphs Nicely. Acta Informatica 22, 187–201 (1985)
Fusy, E.: Straight-Line Drawing of Quadrangulations. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 234–239. Springer, Heidelberg (2007)
Fusy, E.: Transversal Structures on Triangulations: Combinatorial Study and Straight Line Drawing. Ecole Polytechnique (2006)
Fusy, E.: Combinatoire des Cartes Planaires et Applications Algorithmiques. PhD dissertation, Ecole Polytechnique (2007)
He, X.: On Finding the Rectangular Duals of Planar Tringulated Graphs. SIAM Journal on Computing 22, 1218–1226 (1993)
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)
Miura, K., Nishizeki, T.: Rectangle of Four-Connected Plane Graphs. In: Asia-Pacific Symposium on Information Visualization (APVIS), Sydney, Australia. Conferences in Research and Practice in Information Technology, vol. 45 (2005)
Schnyder, W.: Planar Graphs and Poset Dimension. Order 5, 323–343 (1989)
Tutte, W.T.: Drawing Planar Graphs Nicely. Proceedings of London Math. Soc. 13, 743–768 (1963)
Zhang, H.: Planar Polyline Drawings vis Graph Transformation. Algorithmica (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, H., Vaidya, M. (2009). On Open Rectangle-of-Influence Drawings of Planar Graphs. In: Du, DZ., Hu, X., Pardalos, P.M. (eds) Combinatorial Optimization and Applications. COCOA 2009. Lecture Notes in Computer Science, vol 5573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02026-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-02026-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02025-4
Online ISBN: 978-3-642-02026-1
eBook Packages: Computer ScienceComputer Science (R0)