Windows into geometric events: Data structures for time-windowed querying of temporal point sets
MJ Bannister, WE Devanny, MT Goodrich… - arXiv preprint arXiv …, 2014 - arxiv.org
MJ Bannister, WE Devanny, MT Goodrich, JA Simons, L Trott
arXiv preprint arXiv:1409.5452, 2014•arxiv.orgWe study geometric data structures for sets of point-based temporal events, answering time-
windowed queries, ie, given a contiguous time interval we answer common geometric
queries about the point events with time stamps in this interval. The geometric queries we
consider include queries based on the skyline, convex hull, and proximity relations of the
point set. We provide space efficient data structures which answer queries in polylogarithmic
time.
windowed queries, ie, given a contiguous time interval we answer common geometric
queries about the point events with time stamps in this interval. The geometric queries we
consider include queries based on the skyline, convex hull, and proximity relations of the
point set. We provide space efficient data structures which answer queries in polylogarithmic
time.
We study geometric data structures for sets of point-based temporal events, answering time-windowed queries, i.e., given a contiguous time interval we answer common geometric queries about the point events with time stamps in this interval. The geometric queries we consider include queries based on the skyline, convex hull, and proximity relations of the point set. We provide space efficient data structures which answer queries in polylogarithmic time.
arxiv.org
Showing the best result for this search. See all results