Advertisement
Published in:
2010 | OriginalPaper | Chapter
Entropy-Bounded Representation of Point Grids
Authors : Arash Farzan, Travis Gagie, Gonzalo Navarro
Published in: Algorithms and Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We give the first
fully compressed
representation of a set of
m
points on an
n
×
n
grid, taking
H
+
o
(
H
) bits of space, where
$H=\lg {n^2 \choose m}$
is the entropy of the set. This representation supports range counting, range reporting, and point selection queries, with a performance that is comparable to that of uncompressed structures and that improves upon the only previous compressed structure. Operating within entropy-bounded space opens a new line of research on an otherwise well-studied area, and is becoming extremely important for handling large datasets.