Outerplanar Graphs and Delaunay Triangulations

Ashraful Alam, University of Massachusetts Amherst
Igor Rivin, Temple University
Ileana Streinu, Smith College

Archived as published.


Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs. © 2012 Springer-Verlag.