A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Succinct geometric indexes supporting point location queries
2012
ACM Transactions on Algorithms
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking advantage of the n points in the data set permuted and stored elsewhere as a sequence. Our first and main result is a succinct geometric index that can answer point location queries, a fundamental problem in computational geometry, on planar triangulations in O(lg n) time 1 . We also design three variants of this index.
doi:10.1145/2151171.2151173
fatcat:aop6jhrcqrfd3lklm62oewp35u