Continuous Visible Nearest Neighbour Queries
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query line segment q, a CVNN query returns a set of (p, R) tuples such that p ? P is the nearest neighbor (NN) to every point r a...
Saved in:
Main Authors: | GAO, Yunjun, ZHENG, Baihua, LEE, Wang-Chien, CHEN, Gencai |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2009
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/311 https://ink.library.smu.edu.sg/context/sis_research/article/1310/viewcontent/1516360.1516378.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Visible Reverse K-Nearest Neighbor Queries
by: GAO, Yunjun, et al.
Published: (2009) -
Continuous Visible Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2011) -
Processing Mutual Nearest Neighbor Queries for Moving Object Trajectories
by: GAO, Yunjun, et al.
Published: (2008) -
On Efficient Obstructed Reverse Nearest Neighbor Query Processing
by: GAO, Yunjun, et al.
Published: (2011) -
On Efficient Mutual Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009)