2006/09/18 by Hubert De Fraysseix, HUBERT DE FRAYSSEIX, Patrice Ossona De Mendez +3 · 2 citations
Computer Science · Mathematics · #Computational Geometry and Mesh Generation #Polynomial and algebraic computation #Topological and Geometric Data Analysis #math.CO #msc:05C10 #msc:05C75 #msc:05C85
paper · pdf · doi:10.1142/s0129054106004248
published as International Journal of Foundations of Computer Science 17 (5) (2006) 1017-1029 · Special Issue on Graph Drawing
openalex publication_date 2006/09/18 · arxiv created 2006/10/30 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/22
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.