Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Dillencourt  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.
Alam, Ashraful; Rivin, Igor; and Streinu, Ileana, "Outerplanar Graphs and Delaunay Triangulations" (2012). Computer Science: Faculty Publications, Smith College, Northampton, MA.
Archived as published.