Triangulation and CSG representation of polyhedra with arbitrary genus

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 1991, Pages 364-372

  Dey, Tamal K ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; MESH GENERATION; MOTION PLANNING; TRIANGULATION;

COMPLEX OBJECTS; CONSTRUCTIVE SOLID GEOMETRY; DECOMPOSITION PROBLEMS; SOLID MODEL; SUB-PROBLEMS; THREE DIMENSIONAL POLYHEDRA; TREE-PARTITION; TWO-DIMENSION;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 79951548297     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/109648.109689     Document Type: Conference Paper

References (13)

1. Bajaj, C, and Dey, T., (1990) "Polygon Nesting and Robustness", Information Processing Letters, 35, pp. 23-32.
2. Bajaj, C, and Dey, T., (1990), "Convex Decomposition of Polyhedra and Robustness", Tech. Report CSD-TR-990, Computer Science, Purdue University, A revised version is to appear in SIAM J. on Computing.
3. Chazelle, B., (1984), "Convex Partitions of Polyhedra: A Lower Bound and Worst-case Optimal Algorithm", SIAM J, on Computing, Vol. 13, No. 3, pp. 488-507.
4. Chazelle, B., and Palios, L., (1990), "Triangulating a Non-convex Polytope" Discrete and Computational Geometry, 5, pp. 505-526.
5. Dey, T., Bajaj, C, and Sugihara, K., (1991), "On Good Triangulations in Three Dimensions", to appear in the Proc. of Symposium on Solid Modeling Foundations and CAD/CAM Applications (ACM/SIGGRAPH), Texas, 5-7 June, 1991.
6. Dobkin, D., Guibas, L., Hershberger, J., and Snoeyink, J., (1988), "An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon", Computer Graphics, 22, pp. 31-40.
7. Edelsbrunner, H., Guibas, L. and Sharir, M., (1990), "The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments", Discrete and Computational Geometry, 5, pp. 161-196.
8. Edelsbrunner, H., (1987), "Algorithms in Combinatorial Geometry", Springer Verlag.
9. Edelsbrunner, H., Guibas, L., Pach, J., Pollack, R., Seidel, R. and Sharir, M., (1988), "Arrangements of Arcs in the Plane: Topology, Combinatorics, and Algorithms, Proc. 15th Int. Colloq. on Automata, Languages and Programming, pp. 214-229.
10. Karasick, M., (1988) "On the Representation and Manipulation of Rigid Solids", Ph. D. Thesis, McGill University.
11. Paterson, M. S. and Yao, F. F., (1990), "Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling", Discrete and Computational Geometry, 5, pp. 485-503.
12. Peterson, D., (1984), "Halfspaces Representation of Extrusions, Solids of Revolutions, and Pyramids", SANDIA Report SAND84-0572, Sandia National Laboratories.
13. Rupert, J., and Seidel, R., (1989) "On the Difficulty of Tetrahedralizing Three Dimensional Non-convex Polyhedra", Proc. of the Fifth ACM Symposium on Computational Geometry, Saarbrucken, West Germany, pp. 380-392.