Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
type: Item
instance of: scholarly article
title: Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
zbMATH Open document ID: 1059.65022
author: Démian Nave
author: Nikos P. Chrisochoides
author: L. Paul Chew
published in: Computational Geometry
publication date: 2004-08-06T00:00:00Z
review text: Generation and refinement of tetrahedral meshes are considered here. The approach of the authors consists of two steps (i) sequential mesh initialization and (ii) parallel mesh refinement. The significant feature of the authors' algorithm is that the submesh interface are allowed to change as new vertices are inserted concurrently in to the distributed mesh. The authors prove that the parallel refinement algorithm terminates, and generates a new distributed Delauney mesh containing tetrahedra whose circumradius to shortest edge ratio is less than 2.
reviewed by: H. P. Dikshit
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65N50
zbMATH DE Number: 2083154
zbMATH Keywords: Delaunay triangulation
zbMATH Keywords: parallel mesh generation
zbMATH Keywords: distributed mesh data structure
zbMATH Keywords: sequential mesh initialization
zbMATH Keywords: algorithm
zbMATH Keywords: guaranteed-quality mesh generation
describes a project that uses: ParMETIS
MaRDI profile type: Publication
full work available at URL: j.comgeo.2004.03.009
OpenAlex ID: W4238293724
cites work: Q4952602
cites work: Conforming Delaunay triangulations in 3D
cites work: Parallel Delaunay mesh generation kernel
cites work: Distributed parallel Delaunay mesh generation
cites work: Parallel volume meshing using face removals and hierarchical repartitioning
cites work: Load balancing for the parallel adaptive solution of partial differential equations
cites work: An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
cites work: Q4250993
cites work: Q4194442
cites work: Construction of three-dimensional Delaunay triangulations using local transformations
cites work: Geometry and topology for mesh generation
cites work: Q4828926
cites work: Mobile object layer: a runtime substrate for parallel adaptive and irregular computations
cites work: Simultaneous mesh generation and partitioning for Delaunay meshes
cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem
cites work: Delaunay refinement algorithms for triangular mesh generation
cites work: OPTIMAL DELAUNAY POINT INSERTION
DOI: 10.1016/J.COMGEO.2004.03.009
Recommended article: Guaranteed
Recommended article: Parallel Guaranteed Quality Delaunay Uniform Mesh Refinement
Recommended article: Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement
Recommended article: PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
Recommended article: Graded Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Generation
Recommended article: Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software
Recommended article: Parallel Delaunay triangulation for particle finite element methods
Recommended article: Distributed parallel Delaunay mesh generation
Recommended article: Parallel d-D Delaunay Triangulations in Shared and Distributed Memory
description: scientific article; zbMATH DE number 2083154