An algorithm for computing a convex and simple path of bounded curvature in a simple polygon

DOI10.1007/S00453-002-0950-0zbMATH Open1001.68180OpenAlexW1519400727MaRDI QIDQ699767FDOQ699767

Authors: Jean-Daniel Boissonnat, Sylvain Lazard, Subir Kumar Ghosh, Telikepalli Kavitha 

Publication date: 25 September 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0950-0

Recommendations

• Curvature-Constrained Shortest Paths in a Convex Polygon
• Reachability by paths of bounded curvature in a convex polygon
• Convex tours of bounded curvature
• Approximation algorithms for curvature-constrained shortest paths
• scientific article; zbMATH DE number 871939

zbMATH Keywords

collision-free path planning problempoint robot

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (12)

• Curvature-bounded traversals of narrow corridors
• Curvature-Constrained Shortest Paths in a Convex Polygon
• Title not available (Why is that?)
• Reachability by paths of bounded curvature in a convex polygon
• Approximating minimum bending energy path in a simple corridor
• Self-approaching paths in simple polygons
• Self-approaching paths in simple polygons
• The cost of bounded curvature
• Bounded-curvature shortest paths through a sequence of points using convex optimization
• Finding curvature-constrained paths that avoid polygonal obstacles
• Convex tours of bounded curvature
• Approximating minimum bending energy path in a simple corridor

This page was built for publication: An algorithm for computing a convex and simple path of bounded curvature in a simple polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699767)