Sciweavers

25 search results - page 3 / 5
» Shortest path amidst disc obstacles is computable
Sort
View
CG
2006
Springer
13 years 5 months ago
A smooth, obstacle-avoiding curve
An algorithm for finding a smooth, obstacle-avoiding curve in the plane can be quite complicated. The process usually involves finding one or more feasible polyline paths, choosin...
Zhong Li, Dereck S. Meek, Desmond J. Walton
COMPGEOM
2005
ACM
13 years 7 months ago
The Visibility-Voronoi Complex and Its Applications
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
Ron Wein, Jur P. van den Berg, Dan Halperin
EUROGRAPHICS
2010
Eurographics
14 years 2 months ago
Procedural Generation of Roads
In this paper, we propose an automatic method for generating roads based on a weighted anisotropic shortest path algorithm. Given an input scene, we automatically create a path co...
Eric Galin, Adrien Peytavie, Nicolas Maréchal, Er...
ICRA
2007
IEEE
132views Robotics» more  ICRA 2007»
13 years 11 months ago
Smooth Feedback for Car-Like Vehicles in Polygonal Environments
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...
Stephen R. Lindemann, Steven M. LaValle
AROBOTS
2005
100views more  AROBOTS 2005»
13 years 5 months ago
A Sampling-Based Motion Planning Approach to Maintain Visibility of Unpredictable Targets
This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
Rafael Murrieta-Cid, Benjamín Tovar, Seth H...