Interval Stabbing Problems in Small Integer Ranges

* Final gross prices may vary according to local VAT.

Get Access

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)}.