ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Space-efficient dynamic orthogonal point location, segment intersection, and range reporting

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Guy E. Blelloch Carnegie Mellon University, Pittsburgh, PA
Published in:
· Proceeding
SODA '08 Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2008
table of contents
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 31
· Citation Count: 4


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 © 2012 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