A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Visible Nearest Neighbor Queries
[chapter]
Advances in Databases: Concepts, Systems and Applications
We introduce the visible k nearest neighbor (VkNN) query, which finds the k nearest objects that are visible to a query point. We also propose an algorithm to efficiently process the VkNN query. We compute the visible neighbors incrementally as we enlarge the search space. Our algorithm dramatically reduces the search cost compared to existing methods that require the computation of the visibility of all objects in advance. With extensive experiments, we show that our algorithm to process the
doi:10.1007/978-3-540-71703-4_73
dblp:conf/dasfaa/NutanongTZ07
fatcat:el52353ybfcnjpyp64p6ihsboi