In this work we study subdivisions of k-rotationally symmetric planar convex bodies that minimize the maximum relative diameter functional. For some particular subdivisions called k-partitions, consisting of k curves meeting in an interior vertex, we prove that the so-called standard k-partition (given by k equiangular inradius segments) is minimizing for any k 2 N, k > 3. For general subdivisions, we show that the previous result only holds for k 6 6. We also study the optimal set for this problem, obtaining that for each k 2 N, k > 3, it consists of the intersection of the unit circle with the corresponding regular k-gon of certain area. Finally, we also discuss the problem for planar convex sets and large values of k, and conje...
Abstract. We consider subdivisions of bounded convex sets G in two subsets E and G \ E. We obtain se...
AbstractGiven a planar convex set C, we give sublinear approximation algorithms to determine approxi...
AbstractThis paper considers the problem of partitioning a planar set of n points into two subsets s...
In this work we study the maximum relative diameter functional dM in the class of multi-rotationall...
In this work we study the fencing problem consisting of finding a trisection of a 3-rotationally sy...
In this paper we study the bisections of a centrally symmetric planar convex body which minimize the...
In this paper, we study the bisections of a centrally symmetric planar convex body which minimize th...
Fencing problems deal with the bisection of a convex body in a way that some geometric measures are ...
If K is a convex body in the Euclidean space En, we consider the six classic geometric functionals a...
We consider subdivisions of convex bodies G in two subsets E and G\E. We obtain several inequalities...
We examine the problem of partitioning a square into convex polygons which are as circular as possib...
We explore an instance of the question of partitioning a polygon into pieces, each of which is as “c...
We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is ...
For a given planar convex compact set K, consider a bisection {A,B} of K (i.e., A [ B = K and whose...
Please cite this article in press as: A. Cañete et al., Trisections of a 3-rotationally symmetri
Abstract. We consider subdivisions of bounded convex sets G in two subsets E and G \ E. We obtain se...
AbstractGiven a planar convex set C, we give sublinear approximation algorithms to determine approxi...
AbstractThis paper considers the problem of partitioning a planar set of n points into two subsets s...
In this work we study the maximum relative diameter functional dM in the class of multi-rotationall...
In this work we study the fencing problem consisting of finding a trisection of a 3-rotationally sy...
In this paper we study the bisections of a centrally symmetric planar convex body which minimize the...
In this paper, we study the bisections of a centrally symmetric planar convex body which minimize th...
Fencing problems deal with the bisection of a convex body in a way that some geometric measures are ...
If K is a convex body in the Euclidean space En, we consider the six classic geometric functionals a...
We consider subdivisions of convex bodies G in two subsets E and G\E. We obtain several inequalities...
We examine the problem of partitioning a square into convex polygons which are as circular as possib...
We explore an instance of the question of partitioning a polygon into pieces, each of which is as “c...
We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is ...
For a given planar convex compact set K, consider a bisection {A,B} of K (i.e., A [ B = K and whose...
Please cite this article in press as: A. Cañete et al., Trisections of a 3-rotationally symmetri
Abstract. We consider subdivisions of bounded convex sets G in two subsets E and G \ E. We obtain se...
AbstractGiven a planar convex set C, we give sublinear approximation algorithms to determine approxi...
AbstractThis paper considers the problem of partitioning a planar set of n points into two subsets s...