Alpha-algorithms for incremental planarity testing (preliminary version)

1994/01/01 by J. A. La Poutré, Johannes A. La Poutré · 20 citations
Computer Science · Mathematics · #Algorithm #Alpha (finance) #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Digital Image Processing Techniques #Mathematics #Optimization and Search Problems #Planarity testing

paper · doi:10.1145/195058.195439

published in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94, 706-715 (ACM Press)

crossref issued 1994/01/01 · crossref published 1994/01/01 · crossref published-print 1994/01/01 · openalex publication_date 1994/01/01 · crossref created 2003/11/25 · crossref deposited 2025/06/18 · crossref indexed 2025/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• On-line graph algorithms with SPQR-trees
• Efficient Planarity Testing
• Incremental planarity testing
• Maintaining bridge-connected and biconnected components on-line
• A data structure for dynamic trees
• A linear-time algorithm for a special case of disjoint set union

Cited by

• Fully-dynamic planarity testing in polylogarithmic time
• Planarity testing [wikipedia]