TRÉMAUX TREES AND PLANARITY

Authors:

Abstract
We present a simplified version of the DFS-based Left-Right planarity testing and embedding algorithm implemented in Pigale [1, 2], which has been considered as the fastest implemented one [3]. We give here a full justification of the algorithm, based on a topological properties of Trémaux trees.
All Related Versions

This publication has 3 references indexed in Scilit: