TY - JOUR
T1 - Nearest surrounder queries
AU - Lee, Ken C.K.
AU - Lee, Wang Chien
AU - Leong, Hong Va
N1 - Funding Information:
In this work, Ken C. K. Lee and Wang-Chien Lee were supported in part by the US National Science Foundation under Grant numbers IIS-0328881, IIS-0534343, and CNS-0626709. Hong Va Leong was supported in part by the Hong Kong Research Grant Council under Grant number HKBU 1/05C.
PY - 2010
Y1 - 2010
N2 - In this paper, we present a new type of spatial queries called Nearest Surrounder (NS) queries. An NS query determines the nearest polygon-shaped spatial objects (referred to as nearest surrounder objects) and their orientations with respect to a query point from an object set. Besides, we derive two NS query variants, namely, multitier NS (m-NS) queries and angle-constrained NS (ANS) queries. An m-NS query searches multiple layers of NS objects for the same range of angles from a query point. An ANS query searches for NS objects within a specified range of angles. To evaluate NS queries and their variants, we explore angle-based and distance-based bound properties of polygons, and devise two efficient algorithms, namely, Sweep and Ripple, based on R-tree. The algorithms access objects in an order according to their orientations and distances with respect to a given query point, respectively. They are efficient as they can finish a search with one index lookup. Besides, they can progressively deliver a query result. Through empirical studies, we evaluate the proposed algorithms and report their performance for both synthetic and real object sets.
AB - In this paper, we present a new type of spatial queries called Nearest Surrounder (NS) queries. An NS query determines the nearest polygon-shaped spatial objects (referred to as nearest surrounder objects) and their orientations with respect to a query point from an object set. Besides, we derive two NS query variants, namely, multitier NS (m-NS) queries and angle-constrained NS (ANS) queries. An m-NS query searches multiple layers of NS objects for the same range of angles from a query point. An ANS query searches for NS objects within a specified range of angles. To evaluate NS queries and their variants, we explore angle-based and distance-based bound properties of polygons, and devise two efficient algorithms, namely, Sweep and Ripple, based on R-tree. The algorithms access objects in an order according to their orientations and distances with respect to a given query point, respectively. They are efficient as they can finish a search with one index lookup. Besides, they can progressively deliver a query result. Through empirical studies, we evaluate the proposed algorithms and report their performance for both synthetic and real object sets.
UR - http://www.scopus.com/inward/record.url?scp=77956061529&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77956061529&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2009.172
DO - 10.1109/TKDE.2009.172
M3 - Article
AN - SCOPUS:77956061529
SN - 1041-4347
VL - 22
SP - 1444
EP - 1458
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 10
M1 - 5184841
ER -