Additional PC-Tree planarity conditions

Authors:
John M. Boyer
Affiliations:
PureEdge Solutions Inc., Victoria, BC, Canada
Venue:
GD'04 Proceedings of the 12th international conference on Graph Drawing
Year:
2004

Citing 7
Cited 1

A new planarity test

Theoretical Computer Science
Stop minding your p's and q's: a simplified O(n) planar embedding algorithm

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Planarity Testing

Journal of the ACM (JACM)
A simple test for the consecutive ones property

Journal of Algorithms
PC-Trees vs. PQ-Trees

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
PC trees and circular-ones arrangements

Theoretical Computer Science - Computing and combinatorics
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Errors in graph embedding algorithms

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent research efforts have produced new algorithms for solving planarity-related problems. One such method performs vertex addition using the PC-tree data structure, which is similar to but simpler than the well-known PQ-tree. For each vertex, the PC-tree is first checked to see if the new vertex can be added without violating certain planarity conditions; if the conditions hold, the PC-tree is adjusted to add the new vertex and processing continues. The full set of planarity conditions are required for a PC-tree planarity tester to report only planar graphs as planar. This paper provides further analyses and new planarity conditions needed to produce a correct planarity algorithm with a PC-tree.