Incremental planarity testing

The incremental planarity testing problem consists of performing the following operations on a planar graph G with n vertices: (1) testing whether a new edge can be added to G so that the resulting graph is itself planar; (2) adding vertices and edges such that planarity is preserved. An efficient technique for incremental planarity testing that uses O(n) space and supports tests and insertion of vertices and edges in O(log n) time is presented. The bounds for queries and vertex insertions are worst case, and the bound for edge insertions is amortized.<<ETX>>

[1]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[2]  Peter Eades,et al.  An efficient heuristic for identifying a maximum weight planar subgraph , 1982 .

[3]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[4]  Robert E. Tarjan,et al.  Computing an st -Numbering , 1976, Theor. Comput. Sci..

[5]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[6]  Clyde L. Monma,et al.  On the Complexity of Covering Vertices by Faces in a Planar Graph , 1988, SIAM J. Comput..

[7]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[8]  Almira Karabeg.  Classification and detection of obstructions to planarity , 1990 .

[9]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[10]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[11]  Roberto Tamassia,et al.  A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract) , 1988, ICALP.

[12]  Roberto Tamassia,et al.  Fully dynamic techniques for point location and transitive closure in planar structures , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[13]  János Pach,et al.  Small sets supporting fary embeddings of planar graphs , 1988, STOC '88.

[14]  G. Battista,et al.  Hierarchies and planarity theory , 1988, IEEE Trans. Syst. Man Cybern..

[15]  VishkinUzi,et al.  On finding lowest common ancestors: simplification and parallelization , 1988 .

[16]  S. Gill Williamson,et al.  Depth-First Search and Kuratowski Subgraphs , 1984, JACM.

[17]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

[18]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[19]  Norishige Chiba,et al.  A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[20]  N. Biggs,et al.  PLANAR GRAPHS: THEORY AND ALGORITHMS (Annals of Discrete Mathematics 32) , 1989 .

[21]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[22]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.