On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra

Proceedings of the Annual Symposium on Computational Geometry

Volumn Part F130124, Issue , 1989, Pages 380-392

  Ruppert, Jim ^a   Seidel, Raimund ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; POLYNOMIALS;

3-DIMENSIONAL; CONVEX POLYHEDRONS; DECOMPOSITION PROBLEMS; NP COMPLETE; SIMPLE POLYGON; STAR-SHAPED; STEINER POINTS; TETRAHEDRALIZATION;

GEOMETRY;

EID: 77953306547     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73833.73874     Document Type: Conference Paper

References (14)

1. D. Avis and H. ElGindy. Triangulating simplicial point. sets in space. Discrete Cotnput. Geom. 2:99-111, 1987.
2. C.L. Bajaj and T.K. Deg. Convex decompositions of simple polyhedra. Technical Report CSD-TR-833. Purdue Univ. Dept. Comp. Sci., 1989.
3. B. Chazelle. Computational Geometry and Convexity. PhD thesis, l-Ale Universit, y, 1980. Also available as Technical Report. CMU-CS-80-150. CMU Depart,-ment of Computer Science, July lY80.
4. B. Chazelle and L. Palios. Triangulating a nonconvex polytope, 1989. These proceedings.
5. K.L. Clarkson, R.E. Tarjan, and C.J. Van Wyk. A fast Las Vegas algorithm for triangulating a simple polygon. In Proceedings of the 4 th A CM Symposium on Computational Geometry, pages 18-22, 1988.
6. J. Culberson and R. Reckhow. Covering polygons is hard. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science, pages 601-611. IEEE, 1988.
7. H. Edelsbrunner. F.P. Preparata, and D.B. West. Tetrahedrizing point sets in three dimensions. Technical Report UIUCDCS-R-86-1310, University of Rlinois, Dept. Comput. Sci., 1986.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NPCompleteness. W. H. Freeman, San Francisco, 1979.
9. J. ORourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York. 1987.
10. J. ORourke and K. Supowit. Some NP-hard polygon decomposition problems. IEEE Trans. Info. Th., IT-29:181-190, 1983.
11. F. P. Preparata and M. I. Shamos. Computational Geometry-An Introduction. Springer-Veriag, New York, 1985.
12. E. Schiinhardt. ober die Zerlegung von Dreieckspolyedern in Tetraeder. Math. Ann., 98:309-312, 1928.
13. R. Tarjan and C. Van Wyk. An O(nloglogn)-Time algorithm for triangulating a simple polygon. SIAM Journal on Computing, 17(l), February 1988.
14. B. Von Hohenbalken. Finding simplicial subdivisions of polytopes. Mathematical Programming, 21:233-234, 1981.