Advertisement

On triangulating planar graphs under the four-connectivity constraint

  • Therese Biedl
  • Goos Kant
  • Michael Kaufmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 824)

Abstract

Triangulation under constraints is a fundamental problem in the representation of objects. Graph augmentation and mesh generation are related keywords from the areas of graph algorithms and computational geometry. In this paper we consider the triangulation problem for planar graphs under the constraint that four-connectivity has to be satisfied.

Our first result states that triangulating embedded planar graphs without introducing new separating triangles can be solved in linear time and space. If the planar graph is not embedded then deciding whether there exists an embedding with at most K separating triangles is NP-complete. A linear time algorithm for this problem is presented, yielding a solution with at most twice the optimal number. Several related remarks and results are included as well.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bhasker, J., and S. Sahni, A linear algorithm to check for the existence of a rectangular dual of a planar triangulated graph, Networks 7 (1987), pp. 307–317.Google Scholar
  2. [2]
    Chiba, N., and T. Nishizeki, Arboricity and subgraph listing algorithms, SIAM J. Comput. 14 (1985), pp. 210–223.Google Scholar
  3. [3]
    Chiba, N., T. Nishizeki, S. Abe and T. Ozawa, A linear algorithm for embedding planar graphs using PQ-trees, J. of Computer and System Sciences 30 (1985), pp. 54–76.CrossRefGoogle Scholar
  4. [4]
    Di Battista, G., and R. Tamassia, Incremental planarity testing, in: Proc. 30th Annual IEEE Symp. on Foundations of Comp. Science, 1989, pp. 436–441.Google Scholar
  5. [5]
    Di Battista, G., Eades, P., and R. Tamassia, I.G. Tollis, Algorithms for Automatic Graph Drawing: An Annotated Bibliography, Brown Univ., Tech. Rep., 1993.Google Scholar
  6. [6]
    Eswaran, K.P., and R.E. Tarjan, Augmentation problems, SIAM J. Comput. 5 (1976), pp. 653–665.Google Scholar
  7. [7]
    Frank, H. and W. Chou, Connectivity considerations in the design of survivable networks, IEEE Trans. on Circuit Theory, CT-17 (1970), pp. 486–490.Google Scholar
  8. [8]
    Garey, M.R., D.S. Johnson, The Rectilinear Steiner Tree Problem is NP-complete. SIAM J. Appl. Math. 32 (1977), pp. 826–834.CrossRefGoogle Scholar
  9. [9]
    Garey, M.R., D.S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems. Theoret. Comp. Science 1 (1976), pp. 237–267.Google Scholar
  10. [10]
    Kant, G., The Planar Triconnectivity Augmentation Problem, submitted to Theoretical Computer Science, 1993.Google Scholar
  11. [11]
    Hsu, T.-S., On four-connecting a triconnected graph, in: Proc. 33st Annual IEEE Symp. on Found. of Comp. Science, 1992, pp. 70–79.Google Scholar
  12. [12]
    Hsu, T.-S., and V. Ramachandran, A linear time algorithm for triconnectivity augmentation, Proc. 32th Annual IEEE Symp. on Found. of Comp. Sc., 1991, pp. 548–559.Google Scholar
  13. [13]
    Hsu, T.-S., and V. Ramachandran, On finding a smallest augmentation to biconnect a graph, in: W.L. Hsu and R.C.T. Lee (Eds.), Proc. of the Second Annual Int. Symp. on Algorithms, Lecture Notes in Comp. Science 557, Springer-Verlag, 1992, pp. 326–335.Google Scholar
  14. [14]
    Kanevsky, A., R. Tamassia, G. Di Battista and J. Chen, On-line maintenance of the four-connected components of a graph, In: Proc. 32th Annual IEEE Symp. on Foundations of Comp. Science, 1991, pp. 793–801.Google Scholar
  15. [15]
    Kant, G., A More Compact Visibility Representation, in: J. van Leeuwen (Ed.), Proc. 19th Intern. Workshop on Graph-Theoretic Concepts in Comp. Sc. (WG'93), LNCS, Springer 1994, to appear.Google Scholar
  16. [16]
    Kant, G., Algorithms for Drawing Planar Graphs, PhD thesis, Utrecht University, 1993.Google Scholar
  17. [17]
    Kant, G., and X. He, Two Algorithms for Finding Rectangular Duals of Planar Graphs, in: J. van Leeuwen (Ed.), Proc. 19th Intern. Workshop on Graph-Theoretic Concepts in Comp. Sc. (WG'93), LNCS, Springer 1994, to appear.Google Scholar
  18. [18]
    Koźmiński, K., and E. Kinnen, Rectangular dual of planar graphs, Networks 5 (1985), pp. 145–157.Google Scholar
  19. [19]
    Lengauer, Th., Combinatorial Algorithms for Integrated Circuit Layout, Wiley, 1990.Google Scholar
  20. [20]
    Otten, R.H.J.M., and J.G. van Wijk, Graph representation in interactive layout design, in: Proc. IEEE Int. Symp. on Circuits and Systems, 1978, pp. 914–918.Google Scholar
  21. [21]
    Read, R.C., A new method for drawing a graph given the cyclic order of the edges at each vertex, Congr. Numer. 56 (1987), pp. 31–44.Google Scholar
  22. [22]
    Rosenthal, A., and A. Goldner, Smallest augmentation to biconnect a graph, SIAM J. Comput 6 (1977), pp. 55–66.Google Scholar
  23. [23]
    Rosenstiehl, P., and R.E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 343–353.Google Scholar
  24. [24]
    Steiglitz, K., P. Weiner and D.J. Kleitman, The design of minimum-cost survivable networks, IEEE Trans. on Circuit Theory, CT-16 (1969), pp. 455–560.Google Scholar
  25. [25]
    Tamassia, R., and I.G. Tollis, A unified approach to visibility representations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 321–341.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Therese Biedl
    • 1
  • Goos Kant
    • 2
  • Michael Kaufmann
    • 3
  1. 1.RUTCORRutgers UniversityNew BrunswickUSA
  2. 2.Department of Computer ScienceUtrecht UniversityCH Utrechtthe Netherlands
  3. 3.Wilhelm-Schickard-Institut für InformatikUniversität TübingenTübingenGermany

Personalised recommendations