Nearest Neighbors and Continous Nearest Neighbor Queries based on Voronoi Diagrams
نویسندگان
چکیده
منابع مشابه
Conic nearest neighbor queries and approximate Voronoi diagrams
Given a cone C and a set S of n points in R, we want to preprocess S into a data structure so that we can find fast an approximate nearest neighbor to a query point q with respect to the points of S contained in the translation of C with apex at q. We develop an approximate conic Voronoi diagram of Õ(n/ε) size that supports conic nearest neighbor queries in O(log(n/ε)) time. Our preprocessing u...
متن کاملProbabilistic Voronoi Diagrams for Probabilistic Moving Nearest Neighbor Queries
Article history: Received 9 November 2010 Received in revised form 4 February 2012 Accepted 6 February 2012 Available online 21 February 2012 A large spectrum of applications such as location based services and environmental monitoring demand efficient query processing on uncertain databases. In this paper, we propose the probabilistic Voronoi diagram (PVD) for processing moving nearest neighbo...
متن کاملNearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
With the proliferation of wireless communications and the rapid advances in technologies for tracking the positions of continuously moving objects, algorithms for efficiently answering queries about large numbers of moving objects increasingly are needed. One such query is the reverse nearest neighbor (RNN) query that returns the objects that have a query object as their closest object. While a...
متن کاملConstrained Nearest Neighbor Queries
In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as nearest neighbor queries with range constraints. Although both nearest neighbor and range queries have been analyzed extensively in previous literature, the implications of constrained nearest neighbor queries have not bee...
متن کاملVisible Nearest Neighbor Queries
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 visibil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2010
ISSN: 1812-5638
DOI: 10.3923/itj.2010.1467.1475