Tight lower bounds for halfspace range searching

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Sunil Arya The Hong Kong University of Science and Technology, Kowloon, Hong Kong
David M. Mount University of Maryland, College Park, MD, USA
Jian Xia The Hong Kong University of Science and Technology, Kowloon, Hong Kong
Published in:
Cover Image
 
· Proceeding
SoCG '10 Proceedings of the 2010 annual symposium on Computational geometry
Pages 29-37
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-4503-0016-2 doi>10.1145/1810959.1810964
Tight lower bounds for halfspace range searching Published by ACM 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 17
· Downloads (cumulative): 109
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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