Optimal shape and inclusion: open problems
Résumé
Access to the shape by its exterior is solved using convex hull. Many algorithms have been proposed in that way. This contribution addresses the open problem of the access of the shape by its interior also called convex skull. More precisely, we present approaches in discrete case. Furthermore, a simple algorithm to approximate the maximum convex subset of star-shaped polygons is described.