A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We present improved and simplified i/o-efficient algorithms for two problems on planar low-density subdivisions, namely map overlay and point location. More precisely, we show how to preprocess a lowdensity subdivision with n edges in O(sort (n)) i/o's into a compressed linear quadtree such that one can: (i) compute the overlay of two preprocessed subdivisions in O(scan (n)) i/o's, where n is the total number of edges in the two subdivisions, (ii) answer a single point location query in O(log Bdoi:10.1007/978-3-540-77120-3_44 fatcat:kuwc7ktx3vcnzmoxjtcgxpxniu