Document Type
Conference Proceeding
Publication Date
3-1-2012
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
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.
Volume
7160 LNCS
First Page
320
Last Page
329
DOI
10.1007/978-3-642-27654-5_25
ISSN
03029743
Recommended Citation
Alam, Ashraful; Rivin, Igor; and Streinu, Ileana, "Outerplanar Graphs and Delaunay Triangulations" (2012). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/311
Comments
Archived as published.