Schmidt, Jens M.Jens M.Schmidt2020-10-232020-10-232009International Symposium on Algorithms and Computation (ISAAC 2009)http://hdl.handle.net/11420/7651Given 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.enDiscreteInterval intersectionInterval stabbingPoint enclosureStaticInformatikConference Paper10.1007/978-3-642-10631-6_18Other