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.
منابع مشابه
Intrinsic Scale Space for Images on Surfaces: The Geodesic Curvature Flow
Based on the geodesic curvature flow of the iso-gray level conbecomes a geodesic or shrinks into a point. We will limit tours of an image painted on the given surface, the image our discussion to smooth Riemannian surfaces which are is evolved and forms the natural geometric scale space. Its convex at infinity (the convex hull of every compact subset geometrical properties are discussed as well...
متن کاملFixed points for total asymptotically nonexpansive mappings in a new version of bead space
The notion of a bead metric space is defined as a nice generalization of the uniformly convex normed space such as $CAT(0)$ space, where the curvature is bounded from above by zero. In fact, the bead spaces themselves can be considered in particular as natural extensions of convex sets in uniformly convex spaces and normed bead spaces are identical with uniformly convex spaces. In this paper, w...
متن کاملConvex Hulls of Bounded Curvature
In this paper, we consider the problem of computing a convex hull of bounded curvature of a set S of points in the plane, i.e. a set containing S and whose boundary is a curve of bounded curvature of minimal length. We prove that, if the radius of the smallest disk that contains S is greater than 1, such a hull is unique. We show that the computation of a convex hull of bounded curvature reduce...
متن کاملFinding the Maximum Subset with Bounded Convex Curvature
We describe an algorithm for solving an important geometric problem arising in computer-aided manufacturing. When machining a pocket in a solid piece of material such as steel using a rough tool in a milling machine, sharp convex corners of the pocket cannot be done properly, but have to be left for finer tools that are more expensive to use. We want to determine a tool path that maximizes the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 13 شماره
صفحات -
تاریخ انتشار 1999