Delaunay Mesh Construction

Dyer, Ramsay; Zhang, Hao; Moeller, Torsten

Delaunay Mesh Construction

Files

273-282.pdf (282.34 KB)

Date

2007

Authors

Dyer, Ramsay
Zhang, Hao
Moeller, Torsten

Publisher

The Eurographics Association

Abstract

We present algorithms to produce Delaunay meshes from arbitrary triangle meshes by edge flipping and geometrypreserving refinement and prove their correctness. In particular we show that edge flipping serves to reduce mesh surface area, and that a poorly sampled input mesh may yield unflippable edges necessitating refinement to ensure a Delaunay mesh output. Multiresolution Delaunay meshes can be obtained via constrained mesh decimation. We further examine the usefulness of trading off the geometry-preserving feature of our algorithm with the ability to create fewer triangles. We demonstrate the performance of our algorithms through several experiments.

        @inproceedings{:10.2312/SGP/SGP07/273-282
,
booktitle = {Geometry Processing
},
editor = {Alexander Belyaev and Michael Garland
},
title = {{Delaunay Mesh Construction
}},
author = {Dyer, Ramsay and 
Zhang, Hao and 
Moeller, Torsten
},
year = {2007
},
publisher = {The Eurographics Association
},
ISSN = {1727-8384
},
ISBN = {978-3-905673-46-3
},
DOI = {/10.2312/SGP/SGP07/273-282
}
}