An efficient implementation of the PC-trees algorithm of shih and hsu’s planarity test (2003)
by
Wen-lian Hsu
| Venue: | Institute of Information Science, Academia Sinica |
| Citations: | 3 - 0 self |
BibTeX
@TECHREPORT{Hsu03anefficient,
author = {Wen-lian Hsu},
title = {An efficient implementation of the PC-trees algorithm of shih and hsu’s planarity test},
institution = {Institute of Information Science, Academia Sinica},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In Shih & Hsu [9] a simpler planarity test was introduced utilizing a data structure called PC-trees (generalized from PQ-trees). In this paper we give an efficient implementation of that linear time algorithm and illustrate in detail how to obtain a Kuratowski subgraph when the given graph is not planar, and how to obtain the embedding alongside the testing algorithm. We have implemented the algorithm using LEDA and an object code is available at
