Computing Point Enclosures

@article{Vaishnavi1982ComputingPE,
  title={Computing Point Enclosures},
  author={Vijay K. Vaishnavi},
  journal={IEEE Transactions on Computers},
  year={1982},
  volume={C-31},
  pages={22-29}
}
Given a set of n rectangles in the plane, the point enclosure query is the question to determine for any point p which rectangles of the set it is contained in. It is the "dual" of the well-known range query in computational geometry. It is shown that the point enclosure query in the plane can be answered in 0(log n + k) time, where k is the number of rectangles reported. The solution makes use of a new data structure, called the S-tree. The data structure can be generalized to obtain an… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS
22 Citations
10 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Dynamic data structures for orthogonal intersection queries

  • R. A. Finkel, J. L. Bentley
  • Tech . Univ . of Graz , IIG Rep .
  • 1980

Fast algorithms for LSI artwork analysis

  • J. L. Bentley
  • J . Design Automat . Fault - Tolerant Comput .
  • 1978

Lauther , " 4 - dimensional binary search trees as a means to speed up associative searches in design rule verification of integrated circuits

  • C. K. Wong
  • J . Design Automat . Fault - Tolerant Comput .
  • 1978

Quad trees - A data structure for re - trievel on composite keys

  • M. L. Fredman
  • Acta Inform .
  • 1974

Quintary trees : A file structure for multi - dimensional data base systems

  • J. van Leeuwen
  • ACM Trans . Database Syst .

Similar Papers

Loading similar papers…