Fast Delaunay triangulation in three dimensions
DOI10.1016/0045-7825(95)00854-1zbMath0859.65149OpenAlexW2029336492WikidataQ127360071 ScholiaQ127360071MaRDI QIDQ2564605
Publication date: 7 April 1997
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0045-7825(95)00854-1
algorithmrandom walkDelaunay triangulationtriangulation algorithmsacceleration procedurespoint insertion techniquerandomly generated pointstetrahedra generation
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25)
Related Items
Cites Work
- Unnamed Item
- Delaunay triangulation and the convex hull of n points in expected linear time
- Construction of three-dimensional Delaunay triangulations using local transformations
- Vertex based data dependent triangulations
- Automatic mesh generator with specified boundary
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- Tetrahedrizing point sets in three dimensions
- Delaunay triangulation of non-convex planar domains
- An apporach to automatic three-dimensional finite element mesh generation
- Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
- Aspects of three‐dimensional constrained Delaunay meshing
- Fully automatic mesh generator for 3D domains of any shape