| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428512 | Information Processing Letters | 2014 | 7 Pages |
Abstract
Shape Delaunay tessellations are a generalization of the classical Delaunay triangulation of a finite set of points in the plane, where the empty circle condition is replaced by emptiness of an arbitrary convex compact shape. We present some new and basic properties of shape Delaunay tessellations, concerning flipping, subgraph structures, and recognition.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Franz Aurenhammer, Günter Paulini,