OPTIMAL DELAUNAY POINT INSERTION
- 30 October 1996
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 39 (20) , 3407-3437
- https://doi.org/10.1002/(sici)1097-0207(19961030)39:20<3407::aid-nme5>3.0.co;2-c
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraintsInternational 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
- Automatic mesh generator with specified boundaryComputer Methods in Applied Mechanics and Engineering, 1991
- Fully automatic mesh generator for 3D domains of any shapeIMPACT of Computing in Science and Engineering, 1990
- The integrity of geometrical boundaries in the two-dimensional delaunay triangulationCommunications in Applied Numerical Methods, 1990
- Properties of n-dimensional triangulationsComputer Aided Geometric Design, 1986
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Computing Dirichlet Tessellations in the PlaneThe Computer Journal, 1978