Reachability by paths of bounded curvature in convex polygons.
Hee-Kap AhnOtfried CheongJirí MatousekAntoine VigneronPublished in: SCG (2000)
Keyphrases
- minkowski sum
- convex hull
- digital convexity
- strictly convex
- multiscale
- convex polyhedra
- cell complexes
- state space
- shortest path
- curvature estimation
- continuous functions
- planar curves
- optimal path
- transitive closure
- geometric properties
- convex optimization
- convex relaxation
- digital geometry
- differential geometry
- corner detection
- binary images
- mobile robot
- optimal solution