Separators for sphere-packings and nearest neighbor graphs

Full Text:

PDF

PDF

Buy this Article

Buy this Article

Authors:	Gary L. Miller	Carnegie Mellon University, Pittsburgh, Pennsylvania
	Shang-Hua Teng	University of Minnesota, Minneapolis, Minnesota
	William Thurston	University of California, Berkeley, California
	Stephen A. Vavasis	Cornell University, Ithaca, New York

	1997 Article
Bibliometrics
· Downloads (6 Weeks): 9 · Downloads (12 Months): 61 · Downloads (cumulative): 1,245 · Citation Count: 48

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 44 Issue 1, Jan. 1997
Pages 1-29
ACM New York, NY, USA
table of contents doi>10.1145/256292.256294

Tools and Resources

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

Share:

|

Tags: algorithm design and analysis algorithms centerpoint computation of transforms computational geometry computations on discrete structures graph algorithms graph algorithms graph separators partitioning point location probabilistic algorithms probabilistic method rndomized algorithm sphere-preserving mapping theory trees

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