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...
Stereo algorithms for structure reconstruction demand accurate disparities with low mismatch errors
and false positives. Mismatch errors in large textureless regions force most a...
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 ...
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-...
— 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...