On triangulating three-dimensional polygons

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On triangulating three-dimensional polygons

Full text

Pdf (920 KB)

Source

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

Philadelphia, Pennsylvania, United States

Pages: 38 - 47

Year of Publication: 1996

ISBN:0-89791-804-5

Authors

Gill Barequet	School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel
Matthew Dickerson	Middlebury College, Middlebury, Vermont
David Eppstein	Dept. of Information and Computer Science, University of California, Irvine, CA

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): 24, Citation Count: 3

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/237218.237234 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.

	Ad	C.C. Adams, The Knot Book, W.H. Freeman, 1994.
	BE	M. B~a~ AND D. EPPSTEIN, Mesh generation and optimal triangulation, in: Computing in E~- clidean Geometry (F.K. Hwang and D.-Z. Du, eds.), World Scientific, 1992.
	BS1	Gill Barequet , Micha Sharir, Filling gaps in the boundary of a polyhedron, Computer Aided Geometric Design, v.12 n.2, p.207-229, March 1995 [doi>10.1016/0167-8396(94)00011-G]
	BS2	Gill Barequet , Micha Sharir, Piecewise-linear interpolation between polygonal slices, Computer Vision and Image Understanding, v.63 n.2, p.251-272, March 1996 [doi>10.1006/cviu.1996.0018]
	Ch	Bernard Chazelle, Triangulating a simple polygon in linear time, Discrete & Computational Geometry, v.6 n.5, p.485-524, 1991 [doi>10.1007/BF02574703]
	Ed	H. }~.DELSBRUNNER, Triangulations, Lecture Notes, CS497, UIUC, Spring 1991.
	EG	Herbert Edelsbrunner , Leonidas Guibas, Topologically sweeping an arrangement, Journal of Computer and System Sciences, v.38 n.1, p.165-194, February 1989 [doi>10.1016/0022-0000(89)90038-X]
	Fe	Mn<l~ FELLOWS, Problem comer: 6. The complexity of knot triviality and the Arf invariant, in: Graphs and Algorithms: Proc. AMS-IMS- SlAM Joint Summer Research Conf., Contemporar,y Mathematics, 89, American Mathematical Society, 1989, 189-190.
	GO	A. G A:~NTANN AND M.H. OW~ARS, On a class of O(n2) problems in computational geometry, Computational Geometril: Theo~ and Applications, in press.
	Kl	G .T. KLINCS!~K, Minimal triangulations of polygonal domains, Annals of Discrete Mathematics, 9 (19so), 121-12s
	RS	Jim Ruppert , Raimund Seidel, On the difficulty of triangulating three-dimensional nonconvex polyhedra., Discrete & Computational Geometry, v.7 n.3, p.227-253, 1992 [doi>10.1007/BF02187840]
	Sn	Jack Snoeyink, A trivial knot whose spanning disks have exponential size, Proceedings of the sixth annual symposium on Computational geometry, p.139-147, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98555]

CITED BY 3

	Gill Barequet , Daniel Shapiro , Ayellet Tal, History consideration in reconstructing polyhedral surfaces from parallel slices, Proceedings of the 7th conference on Visualization '96, p.149-ff., October 28-29, 1996, San Francisco, California, United States
	Gill Barequet , Christian A. Duncan , Subodh Kumar, RSVP: A Geometric Toolkit for Controlled Repair of Solid Models, IEEE Transactions on Visualization and Computer Graphics, v.4 n.2, p.162-177, April 1998
	Tao Ju, Fixing geometric errors on polygonal models: a survey, Journal of Computer Science and Technology, v.24 n.1, p.19-29, January 2009