The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1982 vol.31)
pp: 22-29
V.K. Vaishnavi , Department of Information Systems, Georgia State University
ABSTRACT
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, January 1982, doi:10.1109/TC.1982.1675881
10 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool