Convex Tours of Bounded Curvature
<|reference_start|>Convex Tours of Bounded Curvature: We 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.<|reference_end|>
@article{boissonnat1999convex,
    title={Convex Tours of Bounded Curvature},
    author={Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc
  Robert, Mariette Yvinec},
    journal={arXiv preprint arXiv:cs/9909004},
    year={1999},
    number={INRIA Research report 2375},
    archivePrefix={arXiv},
    eprint={cs/9909004},
    primaryClass={cs.CG}
}