Related papers: Medial Axis Isoperimetric Profiles
We study metric spaces defined via a conformal weight, or more generally a measurable Finsler structure, on a domain $\Omega \subset \mathbb{R}^2$ that vanishes on a compact set $E \subset \Omega$ and satisfies mild assumptions. Our main…
For arbitrary planar convex domain, we compute the behavior of Christoffel function up to a constant factor using comparison with other simple reference domains. The lower bound is obtained by constructing an appropriate ellipse contained…
This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…
We aim at constructing a smooth basis for isogeometric function spaces on domains of reduced geometric regularity. In this context an isogeometric function is the composition of a piecewise rational function with the inverse of a piecewise…
We study how the existence of a negatively pinched K\"ahler metric on a domain in complex Euclidean space restricts the geometry of its boundary. In particular, we show that if a convex domain admits a complete K\"ahler metric, with pinched…
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…
Faithful yet compact explanations for vision models remain a challenge, as commonly used dense perturbation masks are often fragmented and overfitted, needing careful post-processing. Here, we present a training-free explanation method that…
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 derive optimal estimates for the Bergman kernel and the Bergman metric for certain model domains in $\mathbb{C}^2$ near boundary points that are of infinite type. Being unbounded models, these domains obey certain geometric constraints…
We prove some sharp isoperimetric type inequalities for domains with smooth boundary on Riemannian manifolds. For example, using generalized convexity, we show that among all domains with a lower bound $l$ for the cut distance and Ricci…
We prove that the isoperimetric profile of a convex domain $\Omega$ with compact closure in a Riemannian manifold $(M^{n+1},g)$ satisfies a second order differential inequality which only depends on the dimension of the manifold and on a…
Boundary conforming coordinates are commonly used in plasma physics to describe the geometry of toroidal domains, for example, in three-dimensional magnetohydrodynamic equilibrium solvers. The magnetohydrodynamic equilibrium configuration…
We study local connectedness, local accessibility and finite connectedness at the boundary, in relation to the compactness of the Mazurkiewicz completion of a bounded domain in a metric space. For countably connected planar domains we…
In this paper, we prove that every conformal minimal immersion of a compact bordered Riemann surface $M$ into a minimally convex domain $D\subset \mathbb{R}^3$ can be approximated, uniformly on compacts in $\mathring M=M\setminus bM$, by…
We explore the connection between fractional order partial differential equations in two or more spatial dimensions with boundary integral operators to develop techniques that enable one to efficiently tackle the integral fractional…
We consider the configuration space of planar $n$-gons with fixed perimeter, which is diffeomorphic to the complex projective space $\mathbb{C}P^{n-2}$. The oriented area function has the minimal number of critical points on the…
We equip many non compact non simply connected surfaces with smooth Riemannian metrics whose isoperimetric profile is smooth, a highly non generic property. The computation of the profile is based on a calibration argument, a rearrangement…
Depth estimation is a fundamental problem for light field photography applications. Numerous methods have been proposed in recent years, which either focus on crafting cost terms for more robust matching, or on analyzing the geometry of…
The sparse representation of signals defined on Euclidean domains has been successfully applied in signal processing. Bringing the power of sparse representations to non-regular domains is still a challenge, but promising approaches have…
In this paper the isogeometric Nystr\"om method is presented. It's outstanding features are: it allows the analysis of domains described by many different geometrical mapping methods in computer aided geometric design and it requires only…