Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model

@inproceedings{Afshani2012HigherdimensionalOR,
  title={Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model},
  author={P. Afshani and L. Arge and K. Larsen},
  booktitle={SoCG '12},
  year={2012}
}
  • P. Afshani, L. Arge, K. Larsen
  • Published in SoCG '12 2012
  • Computer Science, Mathematics
  • In this paper, we consider two fundamental problems in the pointer machine model of computation, namely orthogonal range reporting and rectangle stabbing. Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space in a data structure, such that the t points in an axis-aligned query rectangle can be reported efficiently. Rectangle stabbing is the "dual" problem where a set of n axis-aligned rectangles should be stored in a data structure, such that the t… CONTINUE READING
    Improved Pointer Machine and I/O Lower Bounds for Simplex Range Reporting and Related Problems
    9
    Improved range searching lower bounds
    3
    Finding pairwise intersections of rectangles in a query rectangle
    1
    Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ3
    • S. Rahul
    • Computer Science, Mathematics
    • 2015
    12
    Approximate Range Counting Revisited
    7
    A New Lower Bound for Semigroup Orthogonal Range Searching
    1

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES
    Algorithms for Three-Dimensional Dominance Searching in Linear Space
    36
    Filtering Search: A New Approach to Query-Answering
    146