Minimal tetrahedralizations of a class of polyhedra

Journal of Combinatorial Optimization

Volumn 8, Issue 3, 2004, Pages 241-265

  Yang, Boting ^a   Wang, Cao An ^b  

^a UNIVERSITY OF REGINA   (Canada)

^b MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

Computational geometry; Polyhedron; Tetrahedralization

Indexed keywords

APPROXIMATION ALGORITHMS; POLYHEDRON; TETRAHEDRALIZATION; VERTICES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; COMPUTER GRAPHICS; EMBEDDED SYSTEMS; FINITE ELEMENT METHOD; INTEGER PROGRAMMING; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; ROBOTICS; THEOREM PROVING;

COMPUTATIONAL GEOMETRY;

EID: 4344568508     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOCO.0000038910.06360.0a     Document Type: Article

References (23)

1. D. Avis and H. El Gindy, "Triangulating point sets in space," Discrete and Computational Geometry, vol. 2, pp. 99-111, 1987.
2. A. Below, U. Brehm, J.A. De Loera, and J. Richter-Gebert, "Minimal simplicial dissections and triangulations of convex 3-polytopes," Discrete and computational geometry, vol. 24, pp. 35-48, 2000.
3. A. Below, J.A. De Loera, and J. Richter-Gebert, "Finding minimal triangulations of convex 3-polytopes is NP-hard," in Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2000a, pp. 65-66.
4. A. Below, J.A. De Loera, and J. Richter-Gebert, "The complexity of finding small triangulations of convex 3-polytopes," unpublished manuscript, 2000b.
5. M. Bern and D. Eppstein, "Mesh generation and optimal triangulation," in Comparing in Euclidean Geometry, D. Du and F. Hwang (Eds.), World Scientific Publishing Co., 1992.
6. J. Bramble and M. Zlanak, "Triangular elements in the finite element method," Math. Comput., vol. 24, pp. 809-820, 1970.
7. B. Chazelle, "Convex partitions of polyhedra: A lower bound and worst-case optimal algorithm," SIAM J. Computing, vol. 13, pp. 488-507, 1984.
8. B. Chazelle and L. Palios, "Triangulating a nonconvex polytope," Discrete and computational geometry, vol. 5, pp. 505-526, 1990.
9. B. Chazelle and N. Shouraboura, "Bounds on the size of tetrahedralizations," in Proc. 10th ACM Symp. Computational Geometry, 1994, pp. 231-239.
10. F. Chin, S. Fung, and C.-A. Wang, "Approximation for minimum triangulations of simplicial convex 3-polytopes," Discrete and computational geometry, vol. 26, pp. 499-511, 2001.
11. F. Chin and S. Fung "Approximation of minimum triangulation for polyhedron with bounded degrees," in Proc. 12th Annu. Internat. Sympos. Algorithms Comput., Lecture Notes in Computer Science 2223, 2001, pp. 172-184.
12. J.A. De Loera, "Computing minimal and maximal triangulations of convex polytopes," unpublished manuscript, 1999.
13. T. Dey, "Triangulation and CSG representation of polyhedra with arbitrary genus," in Proc. 7th ACM Symp. Computational Geometry, 1991, pp. 364-372.
14. H. Edelsbrunner, F. Preparata, and D. West, "Tetrahedralizing point sets in three dimensions," Journal of Symbolic Computation, vol. 10, pp. 335-347, 1990.
15. J. Hershberger and J. Snoeyink, "Convex polygons made from few lines and convex decompositions of polyhedra," in Proc. 3rd Scand. Workshop on Algorithm Theory, Lecture Notes in Computer Science 621, 1992, pp. 376-387.
16. N.J. Lennes, "Theorems on the simple finite polygon and polyhedron," Am. J. Math., vol. 33, pp. 37-62, 1911.
17. F. Preparata and I. Shamos, Computational Geometry, Springer-Verlag: Berlin, 1985.
18. J. Richter-Gebert, "Finding small triangulations of polytope boundaries is hard," Discrete and Computational Geometry, vol. 24, pp. 503-517, 2000.
19. B.L. Rothschild and E.G. Straus, "On triangulations of the convex hull of n points," Combinatorica, vol. 5, pp. 167-179, 1985.
20. J. Rupert and R. Seidel, "On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra," Discrete and Computational Geometry, vol. 7, pp. 227-253, 1992.
21. E. Schonhardt, "Uber die Zerlegung von Dreieckspolyedern in Tetraeder," Math. Annalen, vol. 98, pp. 309-312, 1928.
22. R. Seidel, "The nature and meaning of perturbations in geometric computing," Discrete and Computational Geometry, vol. 19, pp. 1-17, 1998.
23. C.A. Wang and B. Yang, "Optimal tetrahedralizations of some convex polyhedra," in Abstracts 16th European Workshop Computational Geometry, 2000, pp. 5-9.