Finding Visible kNN Objects in the Presence of Obstacles within the User's View Field dagger
檔案
本條目沒有附加檔案。
日期
2019-03-20
類型
系所
期刊名稱
ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION
卷期與頁次
第 8 卷第 3 期
ISSN
2220-9964
語言
英文
摘要
In many spatial applications, users are only interested in data objects that are visible to them. Hence, finding visible data objects is an important operation in these real-world spatial applications. This study addressed a new type of spatial query, the View field-aware Visible k Nearest Neighbor (V2-kNN) query. Given the location of a user and his/her view field, a V2-kNN query finds data object p so that p is the nearest neighbor of and visible to the user, where visible means the data object is (1) not hidden by obstacles and (2) inside the view field of the user. Previous works on visible NN queries considered only one of these two factors, but not both. To the best of our knowledge, this work is the first to consider both the effect of obstacles and the restriction of the view field in finding the solutions. To support efficient processing of V2-kNN queries, a grid structure is used to index data objects and obstacles. Pruning heuristics are also designed so that only data objects and obstacles relevant to the final query result are accessed. A comprehensive experimental evaluation using both real and synthetic datasets is performed to verify the effectiveness of the proposed algorithms.
關鍵詞
view fieldvisible k nearest neighbor queriesindex designspatial databasesquery processing algorithm所屬典藏
期刊論文引用此條目
Su, I.-F., Chen, D.-L., Lee, C., & Chung, Y.-C. (2019). Finding Visible kNN Objects in the Presence of Obstacles within the User's View Field dagger. ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 8(3), 0. https://doi.org/10.3390/ijgi8030151
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/151700