Sign in

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon.

Jean-Daniel BoissonnatSubir Kumar GhoshTelikepalli KavithaSylvain Lazard
Published in: Algorithmica (2002)
Keyphrases
  • simple polygon
  • convex hull
  • optimal solution
  • learning algorithm
  • endpoints
  • computationally efficient
  • graph structure
  • image processing
  • objective function
  • computational complexity
  • d objects
  • segmentation algorithm