期刊名称：International Journal of Software Engineering and Its Applications
印刷版ISSN：1738-9984
出版年度：2015
卷号：9
期号：11
页码：207-216
出版社：SERSC
摘要：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, . . i i i i O n . . , , : if and only if (i) O i . R and O i is visible to Q, and (ii) " O j . R - O i { } , dist Q , O i ( ) ￡ dist Q , O j ( ) 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.
关键词：Nearest Surrounder; 3D Geospatial Data; Spatial Query
