33 search results - page 2 / 7 » Shortest Path Queries Between Geometric Objects on Surfaces |
ICRA
2006
IEEE
13 years 11 months ago
2006
IEEE
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
COMPGEOM
1998
ACM
13 years 9 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
COMPGEOM
2006
ACM
13 years 11 months 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...
Publication
Ageometric framework for the recognition of three-dimensional objects represented by point
clouds is introducedin this paper. The proposed approach is based on comparing distribut...