Implicitly representing arrangements of lines or segments

Full Text:

PDF

PDF

Buy this Article

Buy this Article

Authors:	H. Edelsbrunner	University of Illinois
	L. J. Guibas	Stanford University, and DEC Systems Research Center
	J. Hershberger	DEC Systems Research Center
	R. Seidel	IBM Almaden Research Center and University of California at Berkeley
	M. Sharir	New York University and Tel Aviv University

	1988 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 14 · Downloads (cumulative): 328 · Citation Count: 7

Published in:

· Proceeding

SCG '88 Proceedings of the fourth annual symposium on Computational geometry

Pages 56-69
ACM New York, NY, USA ©1988
table of contents ISBN:0-89791-270-5 doi>10.1145/73393.73400

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- SoCG '13

Share:

|

Tags: algorithms complexity measures computer vision curve, surface, solid, and object representations geometrical problems and computations hierarchy and geometric transformations path and circuit problems performance preprocessors probabilistic algorithms query processing representations, data structures, and transforms statistical computing theory trees visible line/surface algorithms

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Windows Media Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder