Reachability by paths of bounded curvature in a convex polygon.
Hee-Kap AhnOtfried CheongJirí MatousekAntoine VigneronPublished in: Comput. Geom. (2012)
Keyphrases
- convex hull
- strictly convex
- minkowski sum
- convex optimization
- curvature flow
- multiscale
- shortest path
- digital curves
- polygonal approximation
- transitive closure
- globally optimal
- neural network
- curvature estimation
- feasible set
- differential geometry
- boundary points
- discrete space
- convex relaxation
- piecewise linear
- data sets
- semidefinite
- convex programming
- circular arcs
- geometrical properties
- corner detection
- high curvature
- optimal solution
- image processing
- convex polyhedra
- convexity properties
- convex sets