Abstract
A closed rectangle-of-influence (RI for short) drawing is a straight-line grid drawing in which there is no other vertex inside or on the boundary of the axis parallel rectangle defined by the two end vertices of any edge. Biedl et al. [2] showed that a plane graph G has a closed RI drawing, if and only if it has no filled 3-cycle (a cycle of 3 vertices such that there is a vertex in the proper interior). They also showed that such a graph G has a closed RI drawing in an (n − 1) ×(n − 1) grid, where n is the number of vertices in G. They raised an open question on whether this grid size bound can be improved [2]. Without loss of generality, we investigate maximal plane graphs admitting closed RI drawings in this paper. They are plane graphs with a quadrangular exterior face, triangular interior faces and no filled 3-cycles, known as irreducible triangulations [7]. In this paper, we present a linear time algorithm that computes closed RI drawings for irreducible triangulations. Given an arbitrary irreducible triangulation G with n vertices, our algorithm produces a closed RI drawing with size at most (n − 3) ×(n − 3); and for a random irreducible triangulation, the expected grid size of the drawing is \(({22n \over 27}+O(\sqrt{n})) \times ({22n \over 27}+O(\sqrt{n}))\). We then prove that for arbitrary n ≥ 4, there is an n-vertex irreducible triangulation, such that any of its closed RI drawing requires a grid of size (n − 3) ×(n − 3). Thus the grid size of the drawing produced by our algorithm is tight. This lower bound also answers the open question posed in [2] negatively.
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
Barrire, L., Huemer, C.: 4-labelings and grid embeddings of plane quadrangulations. In: Gansner, E.R. (ed.) GD 2009. LNCS, vol. 5849, pp. 413–414. Springer, Heidelberg (2010)
Biedl, T.C., Bretscher, A., Meijer, H.: Rectangle of influence drawings of graphs without filled 3-cycles. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 359–368. Springer, Heidelberg (1999)
de Mendez, P.O.: Orientations bipolaires. PhD thesis, cole des hautes tudes en sciences sociales (1994)
Even, S., Tarjan, R.E.: Computing an st-numbering. Theoretical Computer Science 2(3), 339–344 (1976)
Felsner, S., Huemer, C., Kappes, S., Orden, D.: Binary labelings for plane quadrangulations and their relatives (April 12, 2006)
Fusy, E.: Combinatoire des cartes planaires et applications algorithmiques. PhD thesis, Ecole Polytechnique (2007)
Fusy, E.: Transversal structures on triangulations: A combinatorial study and straight-line drawings. Discrete Mathematics 309(7), 1870–1894 (2009)
Ichino, M., Sklansky, J.: The relative neighborhood graph for mixed feature variables. Pattern Recognition 18(2), 161–167 (1985)
Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science 172(1-2), 175–193 (1997)
Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs: International Symposium, pp. 215–232 (1967)
Liotta, G., Lubiw, A., Meijer, H., Whitesides, S.H.: The rectangle of influence drawability problem. Computational Geometry: Theory and Applications 10(1), 1–22 (1998)
Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete and Computational Geometry 1(1), 343–353 (1986)
Zhang, H., Vaidya, M.: On open rectangle-of-influence drawings of planar graphs. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol. 5573, pp. 123–134. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sadasivam, S., Zhang, H. (2010). Closed Rectangle-of-Influence Drawings for Irreducible Triangulations. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds) Theory and Applications of Models of Computation. TAMC 2010. Lecture Notes in Computer Science, vol 6108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13562-0_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-13562-0_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13561-3
Online ISBN: 978-3-642-13562-0
eBook Packages: Computer ScienceComputer Science (R0)