Searching for empty convex polygons

Full Text:

PDF

PDF

Buy this Article

Buy this Article

Authors:	D. P. Dobkin	Department of Computer Science, Princeton University, Princeton, New Jersey
	H. Edelsbrunner	SDepaartment of Computer Science, University of ]llinois at Urbana-Champaign, Urbana, Illinois
	M. H. Overmars	aDepartment of Computer Science, University of Utrecht, P. O. Box 80012 NL-3508 TA Utrecht, the Netherlands

Published in:

· Proceeding

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

Pages 224-228
ACM New York, NY, USA ©1988
table of contents ISBN:0-89791-270-5 doi>10.1145/73393.73416

	1988 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 25 · Downloads (cumulative): 421 · Citation Count: 6

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 computations on discrete structures computer vision counting problems geometrical problems and computations graph algorithms measurement performance sorting and searching theory 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