On the Difficulty of Range Searching

@article{Andersson1997OnTD,
  title={On the Difficulty of Range Searching},
  author={Arne Andersson and Kurt Swanson},
  journal={Comput. Geom.},
  year={1997},
  volume={8},
  pages={115-122}
}
Abstract We consider the general problem of (2-dimensional) range reporting allowing arbitrarily convex queries. We show that using a traditional approach, even when incorporating techniques like those used in fusion trees, a polylogarithmic query time cannot be achieved unless more than linear space is used. Our arguments are based on a new non-trivial lower bound in a model of computation which, in contrast to the pointer machine model, allows for the use of arrays and bit manipulation. The… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-4 OF 4 CITATIONS

Space-time Tradeoos for Emptiness Queries Space-time Tradeoos for Emptiness Queries

  • Je Ericksony
  • 1998
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Quantum rendering

VIEW 2 EXCERPTS

New Matrix Assembly Techniques forMeshless Methods

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

Space-Time Tradeoffs for Emptiness Queries

VIEW 2 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

Faster deterministic sorting and searching in linear space

  • Arne Andersson
  • Computer Science
  • Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
VIEW 1 EXCERPT

Sublogarithmic searching without multiplications

  • Arne Andersson
  • Computer Science
  • Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
VIEW 1 EXCERPT

Lower bounds for orthogonal range searching : II . The arithmetic model

  • J. L. Bentley
  • J . ACM
  • 1990

Priority Search Trees

VIEW 1 EXCERPT