28 search results - page 3 / 6 » Dynamic Point Location in General Subdivisions |
COMPGEOM
2006
ACM
14 years 7 days ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
SSD
2007
Springer
2007
Springer
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
14 years 12 days ago
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
MOBISYS
2006
ACM
14 years 5 months ago
2006
ACM
Location determination of mobile users within a building has attracted much attention lately due to its many applications in mobile networking including network intrusion detectio...
TCS
2008
13 years 6 months ago
2008
Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We stud...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...