140 search results - page 8 / 28 » Computing the visibility graph of points within a polygon |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing, the robots achieve rendezvous, that is, they move to a common location....
97
Voted
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
99
Voted
CCCG
2009
15 years 22 days ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
80
Voted
CGF
2000
14 years 11 months ago
2000
We present a technique for accelerating the rendering of high depth-complexity scenes. In a preprocessing stage, we approximate the input model with a hierarchical data structure ...
107
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...