Sciweavers

7 search results - page 1 / 2
» Planning short paths with clearance using explicit corridors
Sort
View
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
13 years 3 months ago
Planning short paths with clearance using explicit corridors
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
Roland Geraerts
COMPGEOM
2005
ACM
13 years 6 months ago
Curvature-bounded traversals of narrow corridors
We consider the existence and efficient construction of bounded curvature paths traversing constant-width regions of the plane, called corridors. We make explicit a width threshol...
Sergey Bereg, David G. Kirkpatrick
IJRR
2008
115views more  IJRR 2008»
13 years 4 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
MIG
2010
Springer
13 years 2 months ago
Navigation Queries from Triangular Meshes
Abstract. Navigation meshes are commonly employed as a practical representation for path planning and other navigation queries in animated virtual environments and computer games. ...
Marcelo Kallmann
COMPGEOM
2005
ACM
13 years 6 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