Interleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation

Jane Tournois 1 Pierre Alliez 1 Olivier Devillers 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : We address the problem of generating 2D quality triangle meshes from a set of constraints provided as a planar straight line graph. The algorithm first computes a constrained Delaunay triangulation of the input set of constraints, then interleaves Delaunay refinement and optimization. The refinement stage inserts a subset of the Voronoi vertices and midpoints of constrained edges as Steiner points. The optimization stage optimizes the shape of the triangles through the Lloyd iteration applied to Steiner points both in 1D along constrained edges and in 2D after computing the bounded Voronoi diagram. Our experiments show that the proposed algorithm inserts fewer Steiner points than Delaunay refinement alone, and improves over the mesh quality.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01179018
Contributor : Olivier Devillers <>
Submitted on : Tuesday, July 21, 2015 - 2:47:36 PM
Last modification on : Saturday, January 27, 2018 - 1:31:33 AM

Links full text

Identifiers

Collections

Citation

Jane Tournois, Pierre Alliez, Olivier Devillers. Interleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation. Proceedings of the 16th International Meshing Roundtable, Oct 2007, Seattle, United States. pp.83-101, ⟨10.1007/978-3-540-75103-8_5⟩. ⟨hal-01179018⟩

Share

Metrics

Record views

280