In this paper we study the problem of minimizing the area for the chord-convex sets of given size, that is, the sets for which each bisecting chord is a segment of length at least 2. This problem has been already studied and solved in the framework of convex sets, though nothing has been said in the non-convex case. We introduce here the relevant concepts and show some first properties.
On the minimization of area among chord-convex sets
PRATELLI, ALDO;
2015-01-01
Abstract
In this paper we study the problem of minimizing the area for the chord-convex sets of given size, that is, the sets for which each bisecting chord is a segment of length at least 2. This problem has been already studied and solved in the framework of convex sets, though nothing has been said in the non-convex case. We introduce here the relevant concepts and show some first properties.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
