Related papers: Extreme problems for convex curves with given rela…
The geodesic total curvature of rectifiable spherical curves is analyzed. We extend to the case of high dimension spheres the explicit formula that holds true for curves supported into the 2-sphere. For this purpose, we take advantage of…
The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on…
There are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finitely many efficient solutions that generate polyhedral inner…
Paul Erd\H{o}s and R. Daniel Mauldin asked a series of questions on certain types of polygons of area $1$, the vertices of which can be found in every planar set of infinite Lebesgue measure. We address two of these questions, one on cyclic…
A linear quadratic Dirichlet control problem posed on a possibly non-convex polygonal domain is analyzed. Detailed regularity results are provided in classical Sobolev (Slobodetskii) spaces. In particular, it is proved that in the presence…
It is well known that the area $U$ of the triangle formed by three tangents to a parabola $X$ is half of the area $T$ of the triangle formed by joining their points of contact. In this article, we study some properties of $U$ and $T$ for…
We study Tur\'an-type extremal problems for distance graphs, motivated by work of Csikv\'ari, Bollob\'as, Tyomkyn, and Uzzell. We determine the maximum number of vertex pairs at distance three in an $n$-vertex graph with no triangle formed…
We investigate plane curves intersecting in at most two unibranched points to study the algebraic exceptional set appearing in standard conjectures of diophantine and hyperbolic geometry. Our first result compares the local geometry of two…
We study the relationship between the areas of the consecutive quadrilaterals cut from a convex quadrilateral in the plane by means of a finite or infinite number of straight lines intersecting two of its opposite sides. Moreover, we obtain…
We are interested in finding sharp bounds for the Cheeger constant $h$ via different geometrical quantities, namely the area $|\cdot|$, the perimeter $P$, the inradius $r$, the circumradius $R$, the minimal width $\omega$ and the diameter…
A convex polygon Q is circumscribed about a convex polygon P if every vertex of P lies on at least one side of Q. We present an algorithm for finding a maximum area convex polygon circumscribed about any given convex n-gon in O(n^3) time.…
The Alexandrov-Fenchel inequality, a far-reaching generalization of the classical isoperimetric inequality to arbitrary mixed volumes, lies at the heart of convex geometry. The characterization of its extremal bodies is a long-standing open…
In this paper, we investigate some polynomial conditions that arise from Euclidean geometry. First we study polynomials related to quadrilaterals with supplementary angles, this includes convex cyclic quadrilaterals, as well as certain…
We develop the calculus of superforms as a tool for convex geometry. The formalism is applied to valuations on convex bodies, the Alexandrov-Fenchel inequalities and Monge- Amp\`ere equations on the boundary of convex bodies.
A class of surfaces-graphs in a Riemannian 3-space with a prescribed projection of one field of principal directions onto a surface $\Pi$ is considered. A problem of determination of such surfaces when both principal curvatures are given…
We obtain algorithms for computing Tverberg partitions based on centerpoint approximations. This applies to a wide range of convexity spaces, from the classic Euclidean setting to geodetic convexity in graphs. In the Euclidean setting, we…
Three results in p-convex geometry are established. First is the analogue of the Levi problem in several complex variables, namely: local p-convexity implies global p-convexity. The second asserts that the support of a minimal p-dimensional…
We study extremal properties of spherical random polytopes, the convex hull of random points chosen from the unit Euclidean sphere in $\mathbb{R}^n$. The extremal properties of interest are the expected values of the maximum and minimum…
Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…
The paper continues the author's research in the problem of quantitative investigation of basic curvelinear quasiinvariants of quasiconformal curves. It concerns polygons with infinite number of vertices and provides various distortion…