189 search results - page 11 / 38 » Shortest Paths Without a Map |
ICCSA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
COMPGEOM
2010
ACM
15 years 2 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...
DCG
2008
14 years 9 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
ESA
2010
Springer
14 years 10 months ago
2010
Springer
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
98
Voted
ICNSC
2007
IEEE
15 years 4 months ago
2007
IEEE
—This paper presents ceiling light landmarks based localization and motion control for a mobile robot. The novel mechanism design for the mobile robot is introduced, and the meth...