One machine, one minute, three billion tetrahedra
From MaRDI portal
Publication:6555420
DOI10.1002/nme.5987zbMATH Open1548.65373MaRDI QIDQ6555420
Jeanne Pellerin, Célestin Marot, Jean-François Remacle
Publication date: 14 June 2024
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Parallel numerical computation (65Y05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Cites Work
- Parallel Delaunay triangulation in three dimensions
- On sorting triangles in a Delaunay tessellation
- Parallel geometric algorithms for multi-core computers
- Locality and bounding-box quality of two-dimensional space-filling curves
- Design and implementation of a practical parallel Delaunay algorithm
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- New challenges in dynamic load balancing
- Compact Hilbert indices: space-filling curves for domains with unequal side lengths
- Delaunay Mesh Generation
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities
- Parallel Delaunay mesh generation kernel
- An algorithm oriented mesh database
- Parallel d-D Delaunay Triangulations in Shared and Distributed Memory
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator
- PUMI
- Incremental constructions con BRIO
- Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
Related Items (1)
A Delaunay refinement algorithm for the particle finite element method applied to free surface flows
This page was built for publication: One machine, one minute, three billion tetrahedra
