Outerplanar graphs and delaunay triangulations

Authors:
Ashraful Alam;Igor Rivin;Ileana Streinu
Affiliations:
Department of Computer Science, University of Massachusetts Amherst, MA;Department of Mathematics, Temple University, Philadelphia, PA;Department of Computer Science, Smith College, Northampton, MA
Venue:
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Year:
2012

Citing 3
Cited 0

Realizability of Delaunay triangulations

Information Processing Letters
Graph-theoretical conditions for inscribability and Delaunay realizability

Discrete Mathematics
An optimal algorithm for realizing a Delaunay triangulation

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.