We propose succinct quadtrees, space-efficient data structures for nearest point and segment queries in 2D space. We can compress both the tree structure and point coordinates and support fast queries. One important application is so called map matching, given GPS location data with errors, to correct errors by finding the nearest road. Experimental results show that our new data structure uses 1/25 working memory of a standard library for nearest point queries.
CITATION STYLE
Ishiyama, K., Kobayashi, K., & Sadakane, K. (2017). Succinct quadtrees for road data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10609 LNCS, pp. 262–272). Springer Verlag. https://doi.org/10.1007/978-3-319-68474-1_18
Mendeley helps you to discover research relevant for your work.