This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computing Point Enclosures
January 1982 (vol. 31 no. 1)
pp. 22-29
V.K. Vaishnavi, Department of Information Systems, Georgia State University
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 efficient algorithm for the point enclosure problem in d-dimensional space d = 2.
Index Terms:
VLSI artwork analysis, Augmented segment trees, databases, dual range queries, inverse range queries, multilayered segment trees, point enclosure queries, segment trees, S-trees
Citation:
V.K. Vaishnavi, "Computing Point Enclosures," IEEE Transactions on Computers, vol. 31, no. 1, pp. 22-29, Jan. 1982, doi:10.1109/TC.1982.1675881
Usage of this product signifies your acceptance of the Terms of Use.