Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains

DOI10.1016/J.COMGEO.2004.03.009MaRDI QIDQ598237zbMATHOpenAlexFDO

Authors Démian Nave, Nikos P. Chrisochoides, L. Paul Chew

Publication date 6 August 2004

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2004.03.009

zbMATH Keywords

algorithmDelaunay triangulationdistributed mesh data structureguaranteed-quality mesh generationparallel mesh generationsequential mesh initialization

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Recommendations

• Guaranteed: quality parallel Delaunay refinement for restricted polyhedral domains
• Parallel Guaranteed Quality Delaunay Uniform Mesh Refinement
• Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement
• PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
• Graded Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Generation
• Effective out-of-core parallel Delaunay mesh refinement using off-the-shelf software
• Parallel Delaunay triangulation for particle finite element methods
• Distributed parallel Delaunay mesh generation
• Parallel \(d\)-D Delaunay triangulations in shared and distributed memory

Cites work

• scientific article; zbMATH DE number 3633698 (Why is no real title available?)
• scientific article; zbMATH DE number 1304272 (Why is no real title available?)
• scientific article; zbMATH DE number 2119655 (Why is no real title available?)
• scientific article; zbMATH DE number 1445289 (Why is no real title available?)
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
• Conforming Delaunay triangulations in 3D
• Construction of three-dimensional Delaunay triangulations using local transformations
• Delaunay refinement algorithms for triangular mesh generation
• Distributed parallel Delaunay mesh generation
• Geometry and topology for mesh generation
• Load balancing for the parallel adaptive solution of partial differential equations
• Mobile object layer: a runtime substrate for parallel adaptive and irregular computations
• OPTIMAL DELAUNAY POINT INSERTION
• Parallel Delaunay mesh generation kernel
• Parallel volume meshing using face removals and hierarchical repartitioning
• Simultaneous mesh generation and partitioning for Delaunay meshes

Cited in

(16)

• Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement
• Parallel Delaunay mesh generation kernel
• Graded Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Generation
• Algorithm 872
• Quality tetrahedral mesh smoothing via boundary-optimized Delaunay triangulation
• Thread-parallel mesh improvement using face and edge swapping and vertex insertion
• Guaranteed: quality parallel Delaunay refinement for restricted polyhedral domains
• Parallel Delaunay triangulation in three dimensions
• Parallel Guaranteed Quality Delaunay Uniform Mesh Refinement
• CGALmesh: a generic framework for Delaunay mesh generation
• Boundary conforming Delaunay mesh generation
• Tetrahedral mesh generation using Delaunay refinement with non-standard quality measures
• Construction of sparse well-spaced point sets for quality tetrahedralizations
• PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
• Out-of-core Constrained Delaunay Tetrahedralizations for Large Scenes
• A consistent parallel isotropic unstructured mesh generation method based on multi-phase SPH

Describes a project that uses

Uses Software

• ParMETIS

This page was built for publication: Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598237)