## Simplified O(n) Planarity Algorithms (2001)

by
John M. Boyer
,
Wendy Myrvold

by
John M. Boyer
,
Wendy Myrvold

@MISC{Boyer01simplifiedo(n),

author = {John M. Boyer and Wendy Myrvold},

title = {Simplified O(n) Planarity Algorithms},

year = {2001}

}

A graph is planar if it can be drawn on the plane with vertices at unique locations and no edge intersections except at the vertex endpoints. Due to the wealth of interest from the computer science community, there are a number of remarkable but complex O(n) planar embedding algorithms. This paper presents an O(n) planar embedding algorithm that avoids a number of the complexities of prior approaches (an early version of this work was presented at the January 1999 Symposium on Discrete Algorithms). In July 1999

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2013 The Pennsylvania State University