2 papers
math.CO2012
Which point sets admit a k-angulation?
Michael S. Payne, Jens M. Schmidt, David R. Wood
For k >= 3, a k-angulation is a 2-connected plane graph in which every internal face is a k-gon. We say that a point set P admits a plane graph G if there is a straight-line drawin…
cs.DS2012
A Planarity Test via Construction Sequences
Jens M. Schmidt
Optimal linear-time algorithms for testing the planarity of a graph are well-known for over 35 years. However, these algorithms are quite involved and recent publications still try…