Related papers: Body of constant width with minimal area in a give…
The paper presents a new method for shape and topology optimization based on an efficient and scalable boundary integral formulation for elasticity. To optimize topology, our approach uses iterative extraction of isosurfaces of a…
In this paper, we study minimizers of the Chon\'e--Rochet variational problem in dimension two. We first establish global $C^1$ regularity on arbitrary bounded convex domains, and then prove global $C^{1,1}$ regularity on bounded strictly…
We revisit the question of existence and regularity of minimizers to weighted least gradient problems on a fixed bounded domain, subject to a Dirichlet boundary condition, in the case where the boundary data is continuous and the weight…
We consider the problem of geometric optimisation of the lowest eigenvalue of the Laplacian in the exterior of a compact set in any dimension, subject to attractive Robin boundary conditions. As an improvement upon our previous work…
We relate the problem of best low-rank approximation in the spectral norm for a matrix $A$ to Kolmogorov $n$-widths and corresponding optimal spaces. We characterize all the optimal spaces for the image of the Euclidean unit ball under $A$…
We give an overview of theoretical and practical aspects of finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of n points in the plane. Both problems are known to be NP-hard and were the…
The problem of covering a region of the plane with a fixed number of minimum-radius identical balls is studied in the present work. An explicit construction of bi-Lipschitz mappings is provided to model small perturbations of the union of…
Consider the problem of fnding the smallest area convex $k$-gon containing $n\in\mathbb{N}$ congruent disks without an overlap. By using Wegner inequality in sphere packing theory we give a lower bound for the area of such polygons. For…
We discuss the global regularity of solutions $f$ to the Dirichlet problem for minimal graphs in the hyperbolic space when the boundary of the domain $\Omega\subset\mathbb R^n$ has a nonnegative mean curvature and prove an optimal…
The main goal of this paper is to present a series of inequalities connecting the surface area measure of a convex body and surface area measure of its projections and sections. We present a solution of a question from S. Campi, P.…
We present the first method to handle curvature regularity in region-based image segmentation and inpainting that is independent of initialization. To this end we start from a new formulation of length-based optimization schemes, based on…
In this work we study the fencing problem consisting of finnding a trisection of a 3-rotationally symmetric planar convex body which minimizes the maximum relative diameter. We prove that an optimal solution is given by the so-called…
In this paper we consider the problem of minimizing area subject to a volume constraint in a given convex set.
In this paper we analyze the relaxed form of a shape optimization problem with state equation $\{{array}{ll} -div \big(a(x)Du\big)=f\qquad\hbox{in}D \hbox{boundary conditions on}\partial D. {array}.$ The new fact is that the term $f$ is…
In this paper we continue to study the connection among the area minimizing problem, certain area functional and the Dirichlet problem of minimal surface equations in a class of conformal cones with a similar motivation from \cite{GZ20}.…
We prove that the optimal way to enclose and separate four planar regions with equal area using the less possible perimeter requires all regions to be connected. Moreover, the topology of such optimal clusters is uniquely determined.
We investigate the dependence of optimal constants in Poincar\'e- Sobolev inequalities of planar domains on the region where the Dirichlet condition is imposed. More precisely, we look for the best Dirichlet regions, among closed and…
We are concerned with the dependence of the lowest eigenvalue of the magnetic Dirichlet Laplacian on the geometry of rectangles, subject to homogeneous fields. We conjecture that the square is a global minimiser both under the area or…
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…
We prove a long standing conjecture concerning the fencing problem in the plane: among planar convex sets of given area, prove that the disc, and only the disc maximizes the length of the shortest area-bisecting curve. Although it may look…