Abstract
We study the problem of transforming plane triangulations into irreducible triangulations, which are plane graphs with a quadrangular exterior face, triangular interior faces and no separating triangles. Our linear time transformation reveals important relations between the minimum Schnyder’s realizers of plane triangulations (Bonichon et al., Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 2607, pp. 499–510, Springer, Berlin, 2003; Research Report RR-1279-02, LaBRI, University of Bordeaux, France; Brehm, Diploma thesis, FB Mathematik und Informatik, Freie Universität Berlin, 2000) and the transversal structures of irreducible triangulations (Fusy, Proceedings of 13th International Symposium on Graph Drawing, Lecture Notes in Computer Science, vol. 3843, pp. 177–188, Springer, Berlin, 2005; He, SIAM J. Comput. 22:1218–1226, 1993). The transformation morphs a 3-connected plane graph into an internally 4-connected plane graph. Therefore some of the graph algorithms designed specifically for 4-connected plane graphs can be applied to 3-connected plane graphs indirectly. As an example of such applications, we present a linear time algorithm that produces a planar polyline drawing for a plane graph with n vertices in a grid of size bounded by W×H, where \(W\leq\lfloor\frac{2n-2}{3}\rfloor\) , and \(W+H\leq\lfloor \frac{4n-4}{3}\rfloor\) . It uses at most \(\lfloor\frac{2n-5}{3}\rfloor\) bends, and each edge uses at most one bend. Our algorithm is area optimal. Compared with the existing area optimal polyline drawing algorithm proposed in Bonichon et al. (Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 2573, pp. 35–46, Springer, Berlin, 2002), our algorithm uses a smaller number of bends. Their bend bound is (n−2).
Similar content being viewed by others
References
di Battista, G., Eades, P., Tammassia, R., Tollis, I.: Graph Drawing: Algorithms for the Visualization of Graphs. Princeton Hall, Princeton (1998)
Bonichon, N., Le Saëc, B., Mosbah, M.: Optimal area algorithm for planar polyline drawings. In: Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 2573, pp. 35–46. Springer, Berlin (2002)
Bonichon, N., Gavoille, C., Hanusse, N.: An information-theoretic upper bound of planar graphs using triangulation. In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 2607, pp. 499–510. Springer, Berlin (2003)
Bonichon, N., Gavoille, C., Hanusse, N.: An information-theoretic upper bound of planar graphs using triangulation. Research Report RR-1279-02, LaBRI, University of Bordeaux, France
Bonichon, N., Gavoille, C., Hanusse, N.: Canonical decomposition of outerplanar maps and application to enumeration, coding and generation. J. Graph Algorithms Appl. 9, 185–204 (2005)
Brehm, E.: 3-orientations and Schnyder 3-tree-decompositions: construction and order structure. Diploma thesis, FB Mathematik und Informatik, Freie Universität Berlin (2000)
Fusy, É.: Transversal structures on triangulations, with application to straight-line drawing. In: Proceedings of 13th International Symposium on Graph Drawing. Lecture Notes in Computer Science, vol. 3843, pp. 177–188. Springer, Berlin (2005)
He, X.: On finding the rectangular duals of planar triangular graphs. SIAM J. Comput. 22, 1218–1226 (1993)
He, X.: Grid embedding of 4-connected plane graphs. Discrete Comput. Geom. 17, 339–358 (1997)
He, X.: On floor-plan of plane graphs. SIAM J. Comput. 28, 2150–2167 (1999)
Rahman, M.S., Nakano, S.-I., Nishizeki, T.: Rectangular grid drawings of plane graphs. Comput. Geom. Theory Appl. 10, 203–220 (1998)
Schnyder, W.: Planar graphs and poset dimension. Order 5, 323–343 (1989)
Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138–148 (1990)
Zhang, H., He, X.: An application of well-orderly trees in graph drawing. Int. J. Found. Comput. Sci. 17, 1129–1142 (2006)
Zhang, H., Sadasivam, S.: On planar polyline drawings. In: Proceedings of the 15th International Symposium on Graph Drawing. Lecture Notes in Computer Science, vol. 4875, pp. 213–218. Springer, Berlin (2007)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported in part by NSF grant CCF-0728830.
Rights and permissions
About this article
Cite this article
Zhang, H. Planar Polyline Drawings via Graph Transformations. Algorithmica 57, 381–397 (2010). https://doi.org/10.1007/s00453-008-9215-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-008-9215-x