Sciweavers

665 search results - page 76 / 133
» Algorithms for Triangulated Terrains
Sort
View
GD
2004
Springer
15 years 3 months ago
Convex Drawings of 3-Connected Plane Graphs
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
ICPR
2008
IEEE
14 years 11 months ago
Towards estimation of dense disparities from stereo images containing large textureless regions
Stereo algorithms for structure reconstruction demand accurate disparities with low mismatch errors and false positives. Mismatch errors in large textureless regions force most a...
Rohith MV, Gowri Somanath, Chandra Kambhamettu, Ca...
JDA
2007
97views more  JDA 2007»
14 years 9 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
MVA
2007
211views Computer Vision» more  MVA 2007»
14 years 11 months ago
Vision-based UAV Navigation in Mountain Area
Most vision-based UAV (Unmanned Aerial Vehicle) navigation algorithms extract manmade features such as buildings or roads, which are well structured in urban terrain, using the CC...
Jihwan Woo, Kilho Son, Teng Li, Gwan Sung Kim, In-...
ICRA
2007
IEEE
144views Robotics» more  ICRA 2007»
15 years 4 months ago
Particle RRT for Path Planning with Uncertainty
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
Nik A. Melchior, Reid G. Simmons