PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES

DOI10.1142/S0218195907002227zbMath1114.65024OpenAlexW2149694164MaRDI QIDQ3430330

Alper Üngör, Daniel A. Spielman, Shang-Hua Teng

Publication date: 21 March 2007

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195907002227

zbMATH Keywords

parallel algorithmscomputational geometrysimplicial meshes

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Thread-parallel mesh improvement using face and edge swapping and vertex insertion ⋮ The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ Dynamic well-spaced point sets

Uses Software

• Triangle

Cites Work

• Unnamed Item
• Unnamed Item
• An upper bound for conforming Delaunay triangulations
• Constrained Delaunay triangulations
• Design and implementation of a practical parallel Delaunay algorithm
• Provably good mesh generation
• Parallel automatic adaptive analysis
• Delaunay refinement algorithms for triangular mesh generation
• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Parallel Algorithms for Adaptive Mesh Refinement
• UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES
• PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS