Beating the spread: time-optimal point meshing

doi:10.1145/1998196.1998252

Beating the spread: time-optimal point meshing

Full Text:

PDF

Buy this Article

Authors:	Gary L. Miller	Carnegie Mellon University, Pittsburgh, PA, USA
	Todd Phillips	Google, Inc., Pittsburgh, PA, USA
	Donald R. Sheehy	Carnegie Mellon University, Pittsburgh, PA, USA

Published in:

	· Proceeding
	SoCG '11 Proceedings of the 27th annual ACM symposium on Computational geometry
	Pages 321-330 ACM New York, NY, USA ©2011 table of contents ISBN: 978-1-4503-0682-9 doi>10.1145/1998196.1998252

	2011 Article
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 24 · Downloads (cumulative): 40 · Citation Count: 1

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 computations on discrete structures epsilon nets geometrical problems and computations mesh generation range spaces sparse voronoi refinement spread theory

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:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder