Abstract
Given a set I of n intervals, a stabbing query consists of a point q and asks for all intervals in I that contain q. The Interval Stabbing Problem is to find a data structure that can handle stabbing queries efficiently. We propose a new, simple and optimal approach for different kinds of interval stabbing problems in a static setting where the query points and interval ends are in {1,⋯,O(n)}. © 2009 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Schmidt, J. M. (2009). Interval stabbing problems in small integer ranges. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 163–172). https://doi.org/10.1007/978-3-642-10631-6_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
