Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
DOI10.1016/j.comgeo.2004.03.009zbMath1059.65022OpenAlexW4238293724MaRDI QIDQ598237
L. Paul Chew, Démian Nave, Nikos Chrisochoides
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
algorithmDelaunay triangulationdistributed mesh data structureguaranteed-quality mesh generationparallel mesh generationsequential mesh initialization
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel numerical computation (65Y05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (5)
Uses Software
Cites Work
- Conforming Delaunay triangulations in 3D
- Construction of three-dimensional Delaunay triangulations using local transformations
- Load balancing for the parallel adaptive solution of partial differential equations
- Delaunay refinement algorithms for triangular mesh generation
- Simultaneous mesh generation and partitioning for Delaunay meshes
- Mobile object layer: a runtime substrate for parallel adaptive and irregular computations
- Distributed parallel Delaunay mesh generation
- Parallel volume meshing using face removals and hierarchical repartitioning
- Geometry and Topology for Mesh Generation
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- OPTIMAL DELAUNAY POINT INSERTION
- Parallel Delaunay mesh generation kernel
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains