ON GOOD TRIANGULATIONS IN THREE DIMENSIONS
1992 ◽
Vol 02
(01)
◽
pp. 75-95
◽
Keyword(s):
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.
2019 ◽
Vol 475
(2223)
◽
pp. 20180781
◽
2013 ◽
Vol 10
(01)
◽
pp. 149-172
◽
1992 ◽
Vol 9
(6)
◽
pp. 457-470
◽
Keyword(s):
1986 ◽
Vol 42
(4)
◽
pp. 261-271
◽
Keyword(s):
2001 ◽
Vol DMTCS Proceedings vol. AA,...
(Proceedings)
◽
Keyword(s):
2008 ◽
Vol 23
(40)
◽
pp. 3411-3417
◽
Keyword(s):
2014 ◽
Vol 571-572
◽
pp. 721-724
Keyword(s):