Generating well-shaped \(d\)-dimensional Delaunay meshes.

DOI10.1016/S0304-3975(02)00437-1zbMath1044.68153OpenAlexW1999793260MaRDI QIDQ1401265

Xiang-Yang Li

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00437-1

zbMATH Keywords

AlgorithmsComputational geometryDelaunay triangulationMesh generationAspect ratio\(d\)-dimensional meshesRadius--edge ratioWell shaped

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

DELAUNAY STABILITY VIA PERTURBATIONS ⋮ Manifold reconstruction using tangential Delaunay complexes ⋮ Triangulating smooth submanifolds with light scaffolding ⋮ Manifold reconstruction in arbitrary dimensions using witness complexes ⋮ Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints ⋮ Interpolation error estimates for harmonic coordinates on polytopes ⋮ Delaunay simplices in diagonally distorted lattices ⋮ Anisotropic Delaunay Mesh Generation ⋮ THE STABILITY OF DELAUNAY TRIANGULATIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constrained Delaunay triangulations
• Delaunay refinement algorithms for triangular mesh generation
• Incremental topological flipping works for regular triangulations
• Smoothing and cleaning up slivers
• An apporach to automatic three-dimensional finite element mesh generation

This page was built for publication: Generating well-shaped \(d\)-dimensional Delaunay meshes.