The Interval Skip List: A Data Structure for Finding All Intervals that Overlap a Point

@inproceedings{Hanson1991TheIS,
  title={The Interval Skip List: A Data Structure for Finding All Intervals that Overlap a Point},
  author={Eric N. Hanson},
  booktitle={WADS},
  year={1991}
}
A problem that arises in computational geometry, pattern matching, and other applications is the need to quickly determine which of a collection of intervals overlap a point. Requests of this type are called stabbing queries. A recently discovered randomized data structure called the skip list can maintain ordered sets eeciently, just as balanced binary search trees can, but is much simpler to implement than balanced trees. This paper introduces an extension of the skip list called the interval… CONTINUE READING