A dynamic data structure for planar graph embedding

  • Roberto Tamassia
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 317)


We present a dynamic data structure that allows for incrementally constructing a planar embedding of a planar graph with n vertices and m edges. The data structure supports the following operations: (1) testing if a new edge can be added to the embedding without introducing crossings; (2) adding and removing vertices and edges. In each case the time complexity is O (log m). The space used and the preprocessing time are O(m). If the graph is simple (i.e. it has no self-loops and no parallel edges), the above bounds become O(log n) and O(n), respectively. This work finds applications in circuit layout, graphics, motion planning, and computer-aided design.


Plane Graph Outgoing Edge Parallel Edge Embedding Problem Planar Embedding 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. Bondy and U. Murty, Graph Theory with Applications, North Holland, 1976.Google Scholar
  2. [2]
    K. Booth and G. Lueker, “Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms,” J. of Computer and System Sciences, vol. 13, pp. 335–379, 1976.Google Scholar
  3. [3]
    N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa, “A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees,” J. of Computer and System Sciences, vol. 30, no. 1, pp. 54–76, 1985.Google Scholar
  4. [4]
    G. Di Battista and R. Tamassia, “Algorithms for Plane Representations of Acyclic Digraphs,” Theoretical Computer Science, vol. 58, no. 2,3, 1988 (to appear).Google Scholar
  5. [5]
    H. Edelsbrunner, L.J. Guibas, and J. Stolfi, “Optimal Point Location in a Monotone Subdivision,” SIAM J. Computing, vol. 15, no. 2, pp. 317–340, 1986.Google Scholar
  6. [6]
    S. Even, Graph Algorithms, Computer Science Press, 1979.Google Scholar
  7. [7]
    S. Even and Y. Shiloach, “An On-Line Edge Deletion Problem,” J. ACM, vol. 28, pp. 1–4, 1981.Google Scholar
  8. [8]
    H. De Fraysseix and P. Rosenstiehl, “A Depth-First-Search Characterization of Planarity,” Annals of Discrete Mathematics, vol. 13, pp. 75–80, 1982.Google Scholar
  9. [9]
    H. De Fraysseix, J. Pach, and R. Pollack, “Small Sets Supporting Fary Embeddings of Planar Graphs,” Proc. 20th ACM Symp. on Theory of Computing, 1988 (to appear).Google Scholar
  10. [10]
    G. Frederickson, “Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications,” SIAM J. Computing, vol. 14, no. 4, pp. 781–798, 1985.Google Scholar
  11. [11]
    O. Fries, K. Mehlhorn, and S. Naher, “Dynamization of Geometric Data Structures,” Proc. ACM Symposium on Computational Geometry, pp. 168–176, 1985.Google Scholar
  12. [12]
    J. Hopcroft and R.E. Tarjan, “Efficient Planarity Testing,” J. ACM, vol. 21, no. 4, pp. 549–568, 1974.Google Scholar
  13. [13]
    T. Ibaraki and N. Katoh, “On-Line Computation of Transitive Closure of Graphs,” Information Processing Letters, vol. 16, pp. 95–97, 1983.Google Scholar
  14. [14]
    G.F. Italiano, “Amortized Efficiency of a Path Retrieval Data Structure,” Theoretical Computer Science, vol. 48, pp. 273–281, 1986.Google Scholar
  15. [15]
    D.G. Kirkpatrick, “Optimal Search in Planar Subdivisions,” SIAM J. Computing, vol. 12, no. 1, pp. 28–35, 1983.Google Scholar
  16. [16]
    D.T. Lee and F.P. Preparata, “Location of a Point in a Planar Subdivision and its Applications,” SIAM J. Computing, vol. 6, no. 3, pp. 594–606, 1977.Google Scholar
  17. [17]
    A. Lempel, S. Even, and I. Cederbaum, “An Algorithm for Planarity Testing of Graphs,” Theory of Graphs, Int. Symposium, Rome, pp. 215–232, 1966.Google Scholar
  18. [18]
    K. Mehlhorn, Data Structures and Algorithms I: Sorting and Searching, Springer-Verlag, 1984.Google Scholar
  19. [19]
    M. Overmars, “Range Searching in a Set of Line Segments,” Proc. ACM Symposium on Computational Geometry, pp. 177–185, 1985.Google Scholar
  20. [20]
    F.P. Preparata, “A New Approach to Planar Point Location,” SIAM J. Computing, vol. 10, no. 3, pp. 473–483, 1981.Google Scholar
  21. [21]
    F.P. Preparata and R. Tamassia, “A Fully Dynamic Planar Point Location Technique,” Technical Report ACT-84, Coordinated Science Laboratory, Univ. of Illinois at Urbana-Champaign, 1987.Google Scholar
  22. [22]
    H. Rohnert, “A Dynamization of the All-Pairs Least Cost Problem,” Lecture Notes in Computer Science (Proc. STACS '85), vol. 182, Springer Verlag, pp. 279–286, 1985.Google Scholar
  23. [23]
    P. Rosenstiehl and R.E. Tarjan, “Rectilinear Planar Layouts of Planar Graphs and Bipolar Orientations,” Discrete & Computational Geometry, vol. 1, no. 4, pp. 342–351, 1986.Google Scholar
  24. [24]
    N. Sarnak and R.E. Tarjan, “Planar Point Location Using Persistent Search Trees,” Communications ACM, vol. 29, no. 7, pp. 669–679, 1986.Google Scholar
  25. [25]
    R. Tamassia and I.G. Tollis, “A Unified Approach to Visibility Representations of Planar Graphs,” Discrete & Computational Geometry, vol. 1, no. 4, pp. 321–341, 1986.Google Scholar
  26. [26]
    R. Tamassia and I.G. Tollis, “Centipede Graphs and Visibility on a Cylinder,” in Graph-Theoretic Concepts in Computer Science, (Proc. Int. Workshop WG '86, Bernierd, June 1986), G. Tinhofer and G. Schmidt (eds.), Lecture Notes in Computer Science, vol. 246, Springer-Verlag, pp. 252–263, 1987.Google Scholar
  27. [27]
    R.E. Tarjan, “Amortized Computational Complexity,” SIAM J. Algebraic Discrete Methods, vol. 6, pp. 306–318, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Roberto Tamassia
    • 1
  1. 1.Coordinated Science LaboratoryUniversity of Illinois at Urbana-ChampaignUrbana

Personalised recommendations