Related papers: A Geometric Solution to the Isoperimetric Problem …
Shape optimization is commonly applied in engineering to optimize shapes with respect to an objective functional relying on PDE solutions. In this paper, we view shape optimization as optimization on Riemannian shape manifolds. We consider…
In this expository paper, we discuss a unified framework for proving various geometric inequalities, based on the so-called Alexandrov-Bakelman-Pucci technique. Examples include Cabr\'e's proof of the classical isoperimetric inequality in…
This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…
We study the problem of finding neck-like features on a surface. Applications for such cuts include robotics, mesh segmentation, and algorithmic applications. We provide a new definition for a surface bottleneck -- informally, it is the…
The geometric form of a building strongly influences its material use, heat losses, and energy efficiency. This paper presents an analytical optimization of L-shaped residential buildings aimed at minimizing the external surface area for a…
We propose a gradient descent method for solving optimization problems arising in settings of tropical geometry - a variant of algebraic geometry that has attracted growing interest in applications such as computational biology, economics,…
The classical isoperimetric inequality in the Euclidean plane $\mathbb{R}^2$ states that for a simple closed curve $M$ of the length $L_{M}$, enclosing a region of the area $A_{M}$, one gets \begin{align*} L_{M}^2\geqslant 4\pi A_{M}.…
We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…
In this article we introduce a new type of cyclic contraction mapping on a pair of subsets of a metric space with a graph and prove best proximity points results for the same. Also, we demonstrate that the number of such points is same with…
We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…
As an important metric for mesh quality evaluation, the isotropy property holds significant value for applications such as texture UV-mapping, physical simulation, and discrete geometric analysis. Classical isotropy remeshing methods adjust…
We study the isoperimetric problem for the radially symmetric measures. Applying the spherical symmetrization procedure and variational arguments we reduce this problem to a one-dimensional ODE of the second order. Solving numerically this…
The notion of strictly outward minimising hull is investigated for open sets of finite perimeter sitting inside a complete noncompact Riemannian manifold. Under natural geometric assumptions on the ambient manifold, the strictly outward…
We provide a simple unified approach to obtain (i) Discrete polygonal isoperimetric type inequalities of arbitrary high order. (ii) Arbitrary high order isoperimetric type inequalities for smooth curves, where both upper and lower bounds…
We investigate the class of geodesic metric discs satisfying a uniform quadratic isoperimetric inequality and uniform bounds on the length of the boundary circle. We show that the closure of this class as a subset of Gromov-Hausdorff space…
We consider the isoperimetric problem in planar sectors with density $r^{p}$, and with density $a>1$ inside the unit disk and $1$ outside. We characterize solutions as a function of sector angle. We also solve the isoperimetric problem in…
We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This…
Geometric programming is an important class of optimization problems that enable practitioners to model a large variety of real-world applications, mostly in the field of engineering design. In many real life optimization problem…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
\kmeans clustering is a fundamental problem in many scientific and engineering domains. The optimization problem associated with \kmeans clustering is nonconvex, for which standard algorithms are only guaranteed to find a local optimum.…