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.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Query Processing in 3D Geospatial Environment
  3.1. Affiliations
  3.2. Invisible Region Formulation
  3.3. 3DNS Query Processing
 4. Evaluation
  4.1. Experiments Environments
  4.2. Experiments Environments
 5. Conclusion
 References

키워드

저자

• Jaehwa Chung [ Dept. of Computer Science, Korea National Open University, Korea ]
• Daewon Lee [ Division of General Education, Seokyeong University, Korea ] Corresponding Author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Software Engineering and Its Applications

• 간기

  월간

• pISSN

  1738-9984

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605