English
Related papers

Related papers: Lower Bound for Convex Hull Area and Universal Cov…

200 papers

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…

Information Theory · Computer Science 2014-10-24 Adityanand Guntuboyina

We study the problem of estimating the convex hull of the image $f(X)\subset\mathbb{R}^n$ of a compact set $X\subset\mathbb{R}^m$ with smooth boundary through a smooth function $f:\mathbb{R}^m\to\mathbb{R}^n$. Assuming that $f$ is a…

Optimization and Control · Mathematics 2024-03-11 Thomas Lew , Riccardo Bonalli , Lucas Janson , Marco Pavone

Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

We briefly comment on the quantum area spectra of black holes, paying particular attention to the size of the spacing between adjacent spectral levels. It has previously been conjectured that this spacing is uniform with a universal value…

General Relativity and Quantum Cosmology · Physics 2010-05-18 A. J. M. Medved

A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…

Computational Geometry · Computer Science 2016-05-02 P. Wiederhold , H. Reyes

In this paper, we study the curvature properties of random complex plane curves. We bound from below the probability that a uniform proportion of the area of a random complex degree $d$ plane curve has a curvature smaller than $-d/8$. Our…

Algebraic Geometry · Mathematics 2024-02-20 Michele Ancona , Damien Gayet

For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…

Metric Geometry · Mathematics 2018-05-01 Yohji Akama , Bobo Hua , Yanhui Su

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

Statistics Theory · Mathematics 2013-11-13 Victor-Emmanuel Brunel

In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the $\epsilon$-covering number of $\C([a, b]^d, B)$, in the $L_p$-metric, $1…

Information Theory · Computer Science 2012-04-03 Adityanand Guntuboyina , Bodhisattva Sen

We show that for any extreme curve in a 3-manifold M, there exist a canonical mean convex hull containing all least area disks spanning the curve. Similar result is true for asymptotic case in hyperbolic 3-space such that for any asymptotic…

Differential Geometry · Mathematics 2007-05-23 Baris Coskunuzer

In this paper we give a lower bound on the waist of the unit sphere of a uniformly convex normed space by using the localization technique in codimension greater than one and a strong version of the Borsuk-Ulam theorem. The tools used in…

Metric Geometry · Mathematics 2019-02-20 Yashar Memarian

In this paper we consider the problem of minimizing area subject to a volume constraint in a given convex set.

Analysis of PDEs · Mathematics 2007-05-23 Edward Stredulinsky , William P. Ziemer

In this paper, we give several results on area minimizing surfaces in strictly mean convex 3-manifolds. First, we study the genus of absolutely area minimizing surfaces in a compact, orientable, strictly mean convex 3-manifold M bounded by…

Differential Geometry · Mathematics 2015-07-02 Theodora Bourni , Baris Coskunuzer

We give a sharp lower bound on the area of a domain that can be enclosed by a closed embedded $\lambda$-convex curve of a given length on the Lobachevsky plane.

Differential Geometry · Mathematics 2014-02-13 Kostiantyn Drach

We provide an efficient algorithm to compute the minimum area of a homotopy between two closed plane curves, given that they divide the plane into finite number of regions. For any positive real number $\varepsilon>0$, we construct a closed…

Geometric Topology · Mathematics 2015-01-05 Zipei Nie

We provide the solution for a fundamental problem of geometric optimization by giving a complete characterization of worst-case optimal disk coverings of rectangles: For any $\lambda\geq 1$, the critical covering area $A^*(\lambda)$ is the…

Computational Geometry · Computer Science 2020-03-19 Sándor P. Fekete , Utkarsh Gupta , Phillip Keldenich , Christian Scheffer , Sahil Shah

Taking the convex hull of a curve is a natural construction in computational geometry. On the other hand, path signatures, central in stochastic analysis, capture geometric properties of curves, although their exact interpretation for…

Metric Geometry · Mathematics 2025-06-02 Carlos Améndola , Darrick Lee , Chiara Meroni

The convex body isoperimetric conjecture in the plane asserts that the least perimeter to enclose given area inside a unit disk is greater than inside any other convex set of area $\pi$. In this note we confirm two cases of the conjecture:…

Differential Geometry · Mathematics 2021-04-13 Bo-Hshiung Wang , Ye-Kai Wang

We show that in Euclidean 3-space any closed curve $\gamma$ which contains the unit sphere within its convex hull has length $L\geq4\pi$, and characterize the case of equality. This result generalizes the authors' recent solution to a…

Differential Geometry · Mathematics 2024-03-27 Mohammad Ghomi , James Wenk

Let $P$ be a set of $n$ points in the plane. We compute the value of $\theta\in [0,2\pi)$ for which the rectilinear convex hull of $P$, denoted by $\mathcal{RH}_\theta(P)$, has minimum (or maximum) area in optimal $O(n\log n)$ time and…

Computational Geometry · Computer Science 2025-01-20 Carlos Alegría-Galicia , David Orden , Carlos Seara , Jorge Urrutia