Convex Tours of Bounded Curvature

Details Convex Tours of Bounded Curvature Convex Tours of Bounded Curvature

1999-09-03

arxiv.org/abs/cs/9909004v1

Computer Science

Computational Geometry

11 pages, 5 figures, abstract presented at European Symposium on Algorithms 1993

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Convex Tours of Bounded Curvature does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convex Tours of Bounded Curvature, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex Tours of Bounded Curvature will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-543093