Delaunay Refinement for Piecewise Smooth Complexes

Authors:
Siu-Wing Cheng;Tamal K. Dey;Edgar A. Ramos
Affiliations:
HKUST, Department of Computer Science and Engineering, Hong Kong, Hong Kong;Ohio State University, Department of Computer Science and Engineering, Ohio, USA;Universidad Nacional de Colombia, Escuela de Matemáticas, Sede Medellín, Medellín, Colombia
Venue:
Discrete & Computational Geometry
Year:
2009

Citing 0
Cited 4

Feature-Preserving Reconstruction of Singular Surfaces

Computer Graphics Forum
Localized delaunay refinement for piecewise-smooth complexes

Proceedings of the twenty-ninth annual symposium on Computational geometry
A novel geometric flow approach for quality improvement of multi-component tetrahedral meshes

Computer-Aided Design
Special Section on CAD/Graphics 2013: Efficient boundary surface reconstruction from heterogeneous volumetric data via tri-prism decomposition

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty posed by small angles between adjacent input elements. These weights are chosen to mimic the local feature size and to satisfy a Lipschitz-like property. A Delaunay refinement algorithm using the weighted Voronoi diagram is shown to terminate with the recovery of the topology of the input. Guaranteed bounds on the aspect ratios, normal variation, and dihedral angles are also provided. To this end, we present new concepts and results including a new definition of local feature size and a proof for a generalized topological ball property.