Triangulation and CSG representation of polyhedra with arbitrary genus

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Triangulation and CSG representation of polyhedra with arbitrary genus

Full text

Pdf (853 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the seventh annual symposium on Computational geometry table of contents

North Conway, New Hampshire, United States

Pages: 364 - 371

Year of Publication: 1991

ISBN:0-89791-426-0

Author

Tamal K. Dey

Department of Computer Science, Purdue University, West Lafayette, IN

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 20, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/109648.109689 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	C. L. Bajaj , T. Dey, Polygon nesting and robustness, Information Processing Letters, v.35 n.1, p.23-32, June 1990 [doi>10.1016/0020-0190(90)90169-X]
	2	Chanderjit L. Bajaj , Tamal K. Dey, Convex decomposition of polyhedra and robustness, SIAM Journal on Computing, v.21 n.2, p.339-364, April 1992 [doi>10.1137/0221025]
	3	Bernard Chazelle, Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm, SIAM Journal on Computing, v.13 n.3, p.488-507, August 1984 [doi>10.1137/0213031]
	4	Bernard Chazelle , Leonidas Palios, Triangulating a nonconvex polytope, Discrete & Computational Geometry, v.5 n.5, p.505-526, 1990 [doi>10.1007/BF02187807]
	5	Tamal K. Dey , Chanderjit L. Bajaj , Kokicki Sugihara, On good triangulations in three dimensions, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, p.431-441, June 05-07, 1991, Austin, Texas, United States [doi>10.1145/112515.112578]
	6	David Dobkin , Leonidas Guibas , John Hershberger , Jack Snoeyink, An efficient algorithm for finding the CSG representation of a simple polygon, ACM SIGGRAPH Computer Graphics, v.22 n.4, p.31-40, Aug. 1988
	7	Herbert Edelsbrunner , Leonidas J. Guibas , Micha Sharir, The complexity and construction of many faces in arrangements of lines and of segments, Discrete & Computational Geometry, v.5 n.2, p.161-196, 1990 [doi>10.1007/BF02187784]
	8	Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, 1987
	9	Herbert Edelsbrunner , Leonidas J. Guibas , János Pach , Richard Pollack , Raimund Seidel , Micha Sharir, Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms, Proceedings of the 15th International Colloquium on Automata, Languages and Programming, p.214-229, July 11-15, 1988
	10	M. S. Karasick, On the representation and manipulation of rigid solids, McGill University, Montreal, Que., Canada, 1989
	11	Michael S. Paterson , F. Frances Yao, Efficient binary space partitions for hidden-surface removal and solid modeling, Discrete & Computational Geometry, v.5 n.5, p.485-503, 1990 [doi>10.1007/BF02187806]
	12	Peterson, D., (1984), "Halfspaces Representation of Extrusions, Solids of Revolutions, and Pyramids", $ANDIA Report $ANDSd-05 72, Sandia National Laboraiories.
	13	J. Ruppert , R. Seidel, On the difficulty of tetrahedralizing 3-dimensional non-convex polyhedra, Proceedings of the fifth annual symposium on Computational geometry, p.380-392, June 05-07, 1989, Saarbruchen, West Germany [doi>10.1145/73833.73875]

CITED BY 5

	Reinhard Klein , Wolfgang Straber, Large mesh generation from boundary models with parametric face representation, Proceedings of the third ACM symposium on Solid modeling and applications, p.431-440, May 17-19, 1995, Salt Lake City, Utah, United States
	Bernard Chazelle, Computational geometry: a retrospective, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.75-94, May 23-25, 1994, Montreal, Quebec, Canada
	Bernard Chazelle , Nadia Shouraboura, Bounds on the size of tetrahedralizations, Proceedings of the tenth annual symposium on Computational geometry, p.231-239, June 06-08, 1994, Stony Brook, New York, United States
	Tamal K. Dey , Chanderjit L. Bajaj , Kokicki Sugihara, On good triangulations in three dimensions, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, p.431-441, June 05-07, 1991, Austin, Texas, United States
	Boting Yang , Cao An Wang, Detecting tetrahedralizations of a set of line segments, Journal of Algorithms, v.53 n.1, p.1-35, October 2004