Reachability by paths of bounded curvature in convex polygons

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2000, Pages 251-259

  Ahn, Hee kap ^a   Cheong, Otfried ^a   Matousek, Jiri ^a   Vigneron, Antoine ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MOBILE ROBOTS;

CONVEX POLYGONS;

COMPUTATIONAL GEOMETRY;

EID: 0033718031     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/336154.336211     Document Type: Conference Paper

References (19)