An implementation for maintaining arrangements of polygons

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An implementation for maintaining arrangements of polygons

Full text

Pdf (196 KB)

Source

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

Vancouver, British Columbia, Canada

Pages: 432 - 433

Year of Publication: 1995

ISBN:0-89791-724-3

Author

Michael Goldwasser

Department of Computer Science, Stanford University, Stanford, 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): 3, Downloads (12 Months): 9, Citation Count: 2

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/220279.220337 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	B. Chazelle , J. Incerpi, Triangulation and shape-complexity, ACM Transactions on Graphics (TOG), v.3 n.2, p.135-152, April 1984 [doi>10.1145/357337.357340]
	2	Herbert Edelsbrunner , Lionidas J Guibas , Jorge Stolfi, Optimal point location in a monotone subdivision, SIAM Journal on Computing, v.15 n.2, p.317-340, May 1986 [doi>10.1137/0215023]
	3	K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, New York, 1993.
	4	B. Romney, C. Godard, M. Goldwasser, and G. Ramkumar. An efficient system for analyzing assembly complexity. Manuscript, Dept. Comput. Sci., Stanford Univ., Stanford, CA, 1994.
	5	Raimund Seidel, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry: Theory and Applications, v.1 n.1, p.51-64, July 1991 [doi>10.1016/S0925-7721(99)00042-5]
	6	Jorge Stolfi, Oriented projective geometry, Academic Press Professional, Inc., San Diego, CA, 1991

CITED BY 2

	Dan Halperin , Christian R. Shelton, A perturbation scheme for spherical arrangements with application to molecular modeling, Proceedings of the thirteenth annual symposium on Computational geometry, p.183-192, June 04-06, 1997, Nice, France
	Dan Halperin , Jean-Claude Latombe , Randall H. Wilson, A general framework for assembly planning: the motion space approach, Proceedings of the fourteenth annual symposium on Computational geometry, p.9-18, June 07-10, 1998, Minneapolis, Minnesota, United States