SIGN IN
SIGN UP
Approximate range searching
Full Text:
Pdf
Buy this Article
Authors:
Sunil Arya
Max-Planck-Institut für Informatik, D-66123 Saarbrücken, Germany
David M. Mount
Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD
Published in:
· Proceeding
SCG '95
Proceedings of the eleventh annual symposium on Computational geometry
Pages 172 - 181
ACM
New York, NY
, USA
©1995
table of contents
ISBN:0-89791-724-3
doi>
10.1145/220279.220298
1995 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 14
· Downloads (cumulative): 399
· Citation Count: 20
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
experimentation
geometrical problems and computations
measurement
sorting and searching
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder