Related papers: Cutting Mutually Congruent Pieces from Convex Regi…

Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…

Let $K$ be a planar convex body af area $|K|$, and take $0 \textless{} \alpha \textless{} 1$.An $\alpha$-section of $K$ is a line cutting $K$ into two parts, one of whichhas area $\alpha|K|$. This article presents a systematic study of the…

Many classical geometric inequalities on functionals of convex bodies depend on the dimension of the ambient space. We show that this dimension dependence may often be replaced (totally or partially) by different symmetry measures of the…

Given a graph $G$ and a set $S \subseteq V(G)$, we say that $S$ is $\Delta$-convex if the neighborhood of every vertex not in $S$ is an independent set. A collection ${\cal V} = (V_1, V_2, \ldots , V_p)$ of convex sets of $G$ is a convex…

We consider the problem of partitioning a two-dimensional flat torus $T^2$ into $m$ sets in order to minimize the maximal diameter of a part. For $m \leqslant 25$ we give numerical estimates for the maximal diameter $d_m(T^2)$ at which the…

A set of vertices X of a graph G is convex if it contains all vertices on shortest paths between vertices of X. We prove that for fixed p, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial…

In this paper we prove some geometric inequalities for closed surfaces in Euclidean three-space. Motivated by Gage's inequality for convex curves, we first verify that for convex surfaces the Willmore energy is bounded below by some…

Using the concepts of mixed volumes and quermassintegrals of convex geometry, we derive an exact formula for the exclusion volume for a general convex body that applies in any space dimension, including both the rotationally-averaged…

Finding a maximum cut is a fundamental task in many computational settings. Surprisingly, it has been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their…

Let D be a compact convex domain in the plane. P\'olya & Szeg\"o and, independently, Levi & Pan defined the point p in D that is "best insulated from the boundary C of D". We compute p in the case when C is an isosceles right triangle,…

We consider the problem of finding a continuous and non-rigid matching between a 2D contour and a 3D mesh. While such problems can be solved to global optimality by finding a shortest path in the product graph between both shapes, existing…

The problem of finding the minimizer of a sum of convex functions is central to the field of distributed optimization. Thus, it is of interest to understand how that minimizer is related to the properties of the individual functions in the…

We confirm two conjectures of Lassak on the area of reduced spherical polygons. The area of every reduced spherical non-regular $n$-gon is less than that of the regular spherical $n$-gon of the same thickness. Moreover, the area of every…

Consider the map $S$ which sends a planar polygon $P$ to a new polygon $S(P)$ whose vertices are the intersection points of second nearest sides of $P$. This map is the inverse of the famous pentagram map. In this paper we investigate the…

We give an overview of the 2024 Computational Geometry Challenge targeting the problem \textsc{Maximum Polygon Packing}: Given a convex region $P$ in the plane, and a collection of simple polygons $Q_1, \ldots, Q_n$, each $Q_i$ with a…

We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with…

We study some measure partition problems: Cut the same positive fraction of $d+1$ measures in $\mathbb R^d$ with a hyperplane or find a convex subset of $\mathbb R^d$ on which $d+1$ given measures have the same prescribed value. For both…

The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms. For questions related to location, the partition problem can be modeled, in…

This paper presents the solution to the following optimization problem: What is the shape of the two-dimensional region that minimizes the average L_p distance between all pairs of points if the area of this region is held fixed? [The L_p…

The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…