Localizing the Delaunay triangulation and its parallel implementation
From MaRDI portal
Recommendations
Cited in
(13)- Local refinement based on the 7-triangle longest-edge partition
- A consistent parallel isotropic unstructured mesh generation method based on multi-phase SPH
- Load-Balancing for Parallel Delaunay Triangulations
- PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
- Construction of K-Dimensional Delaunay Triangulations Using Local Transformations
- scientific article; zbMATH DE number 1795209 (Why is no real title available?)
- scientific article; zbMATH DE number 1822225 (Why is no real title available?)
- scientific article; zbMATH DE number 934894 (Why is no real title available?)
- Parallel Delaunay triangulation for particle finite element methods
- DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- One machine, one minute, three billion tetrahedra
- Parallel Delaunay triangulation in three dimensions
This page was built for publication: Localizing the Delaunay triangulation and its parallel implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868518)