Convex hulls of bounded curvature

Jean-Daniel Boissonnat 1 Sylvain Lazard 1
1 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : 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 reduces to convex programming or to solving a set of algebraic systems.
Document type :
Conference papers
Complete list of metadatas
Contributor : Sylvain Lazard <>
Submitted on : Tuesday, December 22, 2009 - 3:50:56 PM
Last modification on : Saturday, January 27, 2018 - 1:31:31 AM
Long-term archiving on : Friday, June 18, 2010 - 12:04:31 AM


Files produced by the author(s)


  • HAL Id : inria-00442802, version 1



Jean-Daniel Boissonnat, Sylvain Lazard. Convex hulls of bounded curvature. Canadian Conference on Computational Geometry (CCCG'96), 1996, Ottawa, Canada. pp.14-19. ⟨inria-00442802⟩



Record views


Files downloads