Interval Stabbing Problems in Small Integer Ranges

Authors:
Jens M. Schmidt
Affiliations:
Freie Universität, Berlin, Germany
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 5
Cited 2

Filtering search: a new approach to query answering

SIAM Journal on Computing
Sorting in linear time?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Optimal bounds for the predecessor problem

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
New data structures for orthogonal range searching

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Range queries over a compact representation of minimum bounding rectangles

ER'10 Proceedings of the 2010 international conference on Advances in conceptual modeling: applications and challenges
Space-efficient representations of rectangle datasets supporting orthogonal range querying

Information Systems

Quantified Score

Hi-index	0.00

Visualization

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