Convex Tours of Bounded Curvature

Simple item page
dc.creatorBoissonnat, Jean-Daniel
dc.creatorCzyzowicz, Jurek
dc.creatorDevillers, Olivier
dc.creatorRobert, Jean-Marc
dc.creatorYvinec, Mariette
dc.date1999-09-03
dc.date.accessioned2026-07-07T03:24:20Z
dc.date.available2026-07-07T03:24:20Z
dc.descriptionWe consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with $n$ vertices. We present an O(m+n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest possible.
dc.description11 pages, 5 figures, abstract presented at European Symposium on Algorithms 1993
dc.identifierhttps://arxiv.org/abs/cs/9909004
dc.identifierhttp://arxiv.org/abs/cs/9909004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33285
dc.subjectComputational Geometry
dc.subjectF.2.2; I.3.5
dc.titleConvex Tours of Bounded Curvature
dc.typetext

Files

Collections

arXiv