Fast Delaunay triangulation in three dimensions
- 1 December 1995
- journal article
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 128 (1-2) , 153-167
- https://doi.org/10.1016/0045-7825(95)00854-1
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Optimality of the Delaunay triangulation in ℝdDiscrete & Computational Geometry, 1994
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraintsInternational Journal for Numerical Methods in Engineering, 1994
- Aspects of three-dimensional constrained Delaunay meshingInternational Journal for Numerical Methods in Engineering, 1994
- Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedraInternational Journal for Numerical Methods in Engineering, 1992
- Vertex based data dependent triangulationsComputer Aided Geometric Design, 1991
- Fully automatic mesh generator for 3D domains of any shapeIMPACT of Computing in Science and Engineering, 1990
- Delaunay triangulation of non‐convex planar domainsInternational Journal for Numerical Methods in Engineering, 1989
- An apporach to automatic three‐dimensional finite element mesh generationInternational Journal for Numerical Methods in Engineering, 1985
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981