Logo der Universität Wien

Delaunay mesh construction

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.

Grafik Top
Authors
Grafik Top
Supplemental Material
Citation
Category
Paper in Conference Proceedings or in Workshop Proceedings (Full Paper in Proceedings)
Event Title
Eurographics Symposium on Geometry Processing 2007,
Divisions
Visualization and Data Analysis
Subjects
Computergraphik
Event Location
Barcelona, Spain
Event Type
Conference
Event Dates
July 4-6
ISSN/ISBN
978-3-905673-46-3
Date
July 2007
Export
Grafik Top
Contact us
Faculty of Computer Science
University of Vienna

Währinger Straße 29
A-1090 Vienna