A New Planarity Test

A New Planarity Test (1999)

by Wei-kuan Shih , Wen-Lian Hsu

Citations:

16 - 2 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A New Planarity Test	user correction - Legacy Corrections
AUTHOR NAME	Wei-kuan Shih	user correction - Legacy Corrections
AUTHOR AFFIL	1; and Wen-Lian Hsu; 2	user correction - Legacy Corrections
AUTHOR NAME	Wen-Lian Hsu	user correction - Legacy Corrections
ABSTRACT	Given an undirected graph, the planarity testing problem is to determine whether the graph can be drawn in the plane without any crossing edges. Linear time planarity testing algorithms have previously been designed by Hopcroft and Tarjan, and by Booth and Lueker. However, their approaches are quite involved. Several other approaches have also been developed for simplifying the planariy test. In this paper, we developed a very simple linear time testing algorithm based only on a depth-first search tree. When the given graph is not planar, our algorithm immediately produces explicit Kuratowski's subgraphs. A new data structure, PC-trees, is introduced, which can be viewed as abstract subembeddings of actual planar embeddings. A graph-reduction technique is adopted so that the embeddings for the planar biconnected components constructed at each iteration never have to be changed. The recognition and embedding are actually done simultaneously in our algorithm 1 . The implementation of o...	user correction - Legacy Corrections
YEAR	1999	user correction - Legacy Corrections
CITATIONS	10 found	ParsCit 1.0