Finding minimal convex nested polygons

Full Text:

PDF

PDF

Buy this Article

Buy this Article

Authors:	Alok Aggarwal	Mathematical Science Department, IBM Research Center, Yorktown Heights, New York
	Heather Booth	Department of Rlectrical Engineering and Computer Science, The Johns Hopkins University, Baltimore MD
	Joseph O'Rourke	Department of Rlectrical Engineering and Computer Science, The Johns Hopkins University, Baltimore MD
	Subhash Suri	Department of Rlectrical Engineering and Computer Science, The Johns Hopkins University, Baltimore MD
	Chee K. Yap	Courant Institute of Mathematical Sciences, 251 Mcrce Street, New York, NY

	1985 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 19 · Downloads (cumulative): 255 · Citation Count: 6

Published in:

· Proceeding

SCG '85 Proceedings of the first annual symposium on Computational geometry

Pages 296-304
ACM New York, NY, USA ©1985
table of contents ISBN:0-89791-163-6 doi>10.1145/323233.323271

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 computational geometry and object modeling design geometrical problems and computations measurement performance theory verification

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