On the minimum total length of interval systems expressing all intervals, and range-restricted queries

DOI10.1016/j.comgeo.2008.03.004zbMath1158.65013OpenAlexW2025772391MaRDI QIDQ1000921

Hee-Kap Ahn, Chan-Su Shin, Peter Brass, Hyeon-Suk Na

Publication date: 12 February 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.03.004

zbMATH Keywords

interval systemqueryminimum total length

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• On the number of range queries in k-space
• Efficient worst-case data structures for range searching
• Data structures for halfplane proximity queries and incremental Voronoi diagrams
• Farthest-point queries with geometric and combinatorial constraints
• ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH
• Lower bounds for orthogonal range searching: I. The reporting case
• Lower bounds for orthogonal range searching: part II. The arithmetic model
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching

This page was built for publication: On the minimum total length of interval systems expressing all intervals, and range-restricted queries