277 search results - page 10 / 56 » New results on shortest paths in three dimensions |
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
JUCS
2010
13 years 6 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
AROBOTS
2007
13 years 7 months ago
2007
The process of protein crystallization is explained using the theory of robotics, particularly path planning of mobile robots. Path planning is a procedure which specifies motion ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...