Sciweavers

665 search results - page 12 / 133
» Algorithms for Triangulated Terrains
Sort
View
DARS
2000
Springer
128views Robotics» more  DARS 2000»
13 years 11 months ago
Terrain Model Acquisition by Mobile Robot Teams and n-Connectivity
Abstract. The connectivity of the con guration space has been a valuable concept in the motion planning for single robots in both known and unknown terrains. We show here that n-co...
Nageswara S. V. Rao
VIS
2004
IEEE
139views Visualization» more  VIS 2004»
14 years 8 months ago
Compatible Triangulations of Spatial Decompositions
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
Berk Geveci, Mathieu Malaterre, William J. Schroed...
AROBOTS
2006
106views more  AROBOTS 2006»
13 years 7 months ago
Visual wheel sinkage measurement for planetary rover mobility characterization
Wheel sinkage is an important indicator of mobile robot mobility in natural outdoor terrains. This paper presents a vision-based method to measure the sinkage of a rigid robot whee...
Christopher A. Brooks, Karl Iagnemma, Steven Dubow...
ICCS
2004
Springer
14 years 23 days ago
Velocity Field Modelling for Pollutant Plume Using 3-D Adaptive Finite Element Method
Air pollution models usually start from the computation of the velocity field of a fluid. In this paper, we present a model for computing that field based on the contribution of...
Gustavo Montero, Rafael Montenegro, José Ma...
COMPGEOM
2008
ACM
13 years 9 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri