# 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} }

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

28 Citations

Improved Pointer Machine and I/O Lower Bounds for Simplex Range Reporting and Related Problems

- Mathematics, Computer Science
- 2013

9

Improved pointer machine and I/O lower bounds for simplex range reporting and related problems

- Computer Science, Mathematics
- 2012

5

Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ3

- Computer Science, Mathematics
- 2015

12

#### References

##### Publications referenced by this paper.

SHOWING 1-2 OF 2 REFERENCES

Algorithms for Three-Dimensional Dominance Searching in Linear Space

- Computer Science, Mathematics
- 1998

36