Pages that link to "Item:Q578916"
From MaRDI portal
The following pages link to Linear space data structures for two types of range search (Q578916):
Displaying 10 items.
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- The intersection searching problem for c-oriented polygons (Q751326) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- Algorithms for three-dimensional dominance searching in linear space. (Q2583568) (← links)
- Features of solving the range searching problems for d-dimensional case (Q2850360) (← links)
- On Dominance Reporting in 3D (Q3541072) (← links)
- An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization (Q4555537) (← links)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)
- Space Efficient Multi-dimensional Range Reporting (Q5323066) (← links)
- Linear space adaptive data structures for planar range reporting (Q5964824) (← links)