Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
Authors:
- 15 April 1992
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 33 (5) , 975-995
Abstract
This paper presents a method for creating a Delaunay triangulation connected to a set of specified points. The theoretical aspect is recalled for an arbitrary dimension and the method is discussed in order to derive a practical approach, valid for dimensions 2 and 3, which is simple, robust and well adapted to computation. Convex polyhedral and arbitrary polyhedral situations are introduced.Keywords
This publication has 13 references indexed in Scilit:
- Fully automatic mesh generator for 3D domains of any shapeIMPACT of Computing in Science and Engineering, 1990
- Automatic 3D mesh generation with prescribed meshed boundaries (alternator)IEEE Transactions on Magnetics, 1990
- The integrity of geometrical boundaries in the two-dimensional delaunay triangulationCommunications in Applied Numerical Methods, 1990
- Implementing Watson's algorithm in three dimensions1986
- Geometric structures for three-dimensional shape representationACM Transactions on Graphics, 1984
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Preface1978
- Automatic triangulation of arbitrary planar domains for the finite element methodInternational Journal for Numerical Methods in Engineering, 1974
- Covering space with equal spheresMathematika, 1959