Planar point location for large data sets: to seek or not to seek

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Jan Vahrenhold FB 10, Institut für Informatik, Westfälische Wilhelms-Universität, Einsteinstr. 62, 48149 Münster, Germany
Klaus H. Hinrichs FB 10, Institut für Informatik, Westfälische Wilhelms-Universität, Einsteinstr. 62, 48149 Münster, Germany
Published in:
· Journal
Journal of Experimental Algorithmics (JEA) JEA Homepage archive
Volume 7, 2002
Page 8
ACM New York, NY, USA
table of contents doi>10.1145/944618.944626
Planar point location for large data sets: to seek or not to seek Published by ACM 2002 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 37
· Downloads (cumulative): 688
· Citation Count: 3


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