Interval stabbing problems in small integer ranges

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5878 LNCS, Issue , 2009, Pages 163-172

  Schmidt, Jens M ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Discrete; Interval intersection; Interval stabbing; Point enclosure; Static

Indexed keywords

DISCRETE; DISCRETE INTERVALS; INTERVAL INTERSECTION; QUERY POINTS;

COMPUTATION THEORY; DATA STRUCTURES; ENCLOSURES;

COMPUTATIONAL EFFICIENCY;

EID: 75649147043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_18     Document Type: Conference Paper

References (9)

1. Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS 2000, pp. 198-207 (2000)
2. Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? In: STOC 1995, pp. 427-436 (1995)
3. Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem. In: STOC 1999: Proceedings of the 31st annual ACM symposium on Theory of computing, pp. 295-304. ACM, New York (1999)
4. Bentley, J.L.: Solutions to Klee's rectangle problems. Tech. report, Carnegie-Mellon Univ., Pittsburgh, PA (1977)
5. Chazelle, B.: Filtering search: A new approach to query answering. SIAM J. Comput. 15(3), 703-724 (1986)
6. Edelsbrunner, H.: Dynamic data structures for orthogonal intersection queries. Tech. Report F59, Inst. Informationsverarb, Tech. Univ. Graz (1980)
7. Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: STOC 1984: Proceedings of the 16th annual ACM symposium on Theory of computing, pp. 135-143 (1984)
8. McCreight, E.M.: Efficient algorithms for enumerating intersecting intervals and rectangles. Tech. Report CSL-80-9, Xerox Palo Alto Res. Center, CA (1980)
9. McCreight, E.M.: Priority search trees. SIAM Journal on Computing 14(2), 257-276 (1985)