665 search results - page 35 / 133 » Algorithms for Triangulated Terrains |
104
click to vote
AROBOTS
2002
14 years 9 months ago
2002
We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localiza...
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
ASPDAC
2001
ACM
15 years 1 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
IROS
2008
IEEE
15 years 4 months ago
2008
IEEE
—This paper proposes a method for near-optimal navigation of high speed mobile robots on uneven terrain. The method relies on a layered control strategy. A high-level planning la...
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we present a monocular camera based terrain classification scheme. The uniqueness of the proposed scheme is that it inherently incorporates spatial smoothness while...