ON GOOD TRIANGULATIONS IN THREE DIMENSIONS
- 1 March 1992
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Geometry & Applications
- Vol. 02 (01) , 75-95
- https://doi.org/10.1142/s0218195992000068
Abstract
In this paper, we give an algorithm that triangulates the convex hull of a three dimensional point set with guaranteed quality tetrahedra. Good triangulations of convex polyhedra are a special case of this problem. We also give a bound on the number of additional points used to achieve these guarantees and report on the techniques we use to produce a robust implementation of this algorithm under finite precision arithmetic.Keywords
This publication has 0 references indexed in Scilit: