earticle

영어

The Nearest Surrounder (NS) query is to find a set of all the visible objects that are not
obstructed by other objects around the query location. Formally, for a given query Q and
dataset D, NS(Q) returns a set of tuples, ni : if and only if (i) Oi □ R and Oi is
visible to Q, and (ii) □Oj□R□{Oi} , dist (Q,Oi)□ dist (Q,Oj) at angular range [Θi→,Θi←), where i≠ j. Using the R-tree index, NS query processing algorithm is based on the not only distance
bounding properties but also angle-based bounding properties. Although NS query has a
wide spectrum of applications, such as surveillance and augmented reality services, the
existing work is not able to effectively support the 3D geospatial environments. Motivated
by the weaknesses, we suggests a solution, termed 3D Nearest Surrounder (3DNS) query,
to maintain NS query result from a dataset of 3D geospatial objects. In this paper, we
propose heuristics for 3DNS query based on R-tree spatial index without pre-computing
the visible region.