The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that, by taking advantage of the n points in the data set permuted and stored elsewhere as a sequence, to support geometric queries in optimal time. 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. We also design three variants of this index.arXiv:0805.4147v1 fatcat:o27rcrfifjej5hs7l56mjkq7je