Related papers: The wrapping hull and a unified framework for volu…

Recently, motivated by the rapid increase of the data size in various applications, Monemizadeh [APPROX'23] and Driemel, Monemizadeh, Oh, Staals, and Woodruff [SoCG'25] studied geometric problems in the setting where the only access to the…

For a planar point set $P$, its convex hull is the smallest convex polygon that encloses all points in $P$. The construction of the convex hull from an array $I_P$ containing $P$ is a fundamental problem in computational geometry. By…

The volume function V(t) of a compact set S\in R^d is just the Lebesgue measure of the set of points within a distance to S not larger than t. According to some classical results in geometric measure theory, the volume function turns out to…

In this note we investigate the behavior of the volume that the convex hull of two congruent and intersecting simplices in Euclidean $n$-space can have. We prove some useful equalities and inequalities on this volume. For the regular…

We derive explicit formulae for the expected volume and the expected number of facets of the convex hull of several multidimensional Gaussian random walks in terms of the Gaussian persistence probabilities. Special cases include the already…

In this paper we consider the convex hull of a spherically symmetric sample in $R^d$. Our main contributions are some new asymptotic results for the expectation of the number of vertices, number of facets, area and the volume of the convex…

Let $S$ be a finite set, and $X_1,\ldots,X_n$ an i.i.d. uniform sample from $S$. To estimate the size $|S|$, without further structure, one can wait for repeats and use the birthday problem. This requires a sample size of the order…

The signed volume function for polyhedra can be generalized to a mean volume function for volume elements by averaging over the triangulations of the underlying polyhedron. If we consider these up to translation and scaling, the resulting…

In this work, we analyze an efficient sampling-based algorithm for general-purpose reachability analysis, which remains a notoriously challenging problem with applications ranging from neural network verification to safety analysis of…

We estimate the support of a uniform density, when it is assumed to be a convex polytope or, more generally, a convex body in $\R^d$. In the polytopal case, we construct an estimator achieving a rate which does not depend on the dimension…

Conformal prediction quantifies the uncertainty of machine learning models by augmenting point predictions with valid prediction sets. For complex scenarios involving multiple trials, models, or data sources, conformal prediction sets can…

We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the $d$-dimensional Euclidean space. When the radius $r$ of the balls is large, this volume can be approximated by a polynomial of…

In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points,…

We investigate the distribution of the volume and coordination number associated to each particle in a jammed packing of monodisperse hard sphere using the mesoscopic ensemble developed in Nature 453, 606 (2008). Theory predicts an…

Given a random sample of points from some unknown distribution, we propose a new data-driven method for estimating its probability support $S$. Under the mild assumption that $S$ is $r$-convex, the smallest $r$-convex set which contains the…

Convex hulls are a fundamental geometric tool used in a number of algorithms. As a side-effect of exhaustive tests for an algorithm for which a convex hull computation was the first step, interesting experimental results were found and are…

In this paper we study the following geometric problem: given $2^n-1$ real numbers $x_A$ indexed by the non-empty subsets $A\subset \{1,..,n\}$, is it possible to construct a body $T\subset \mathbb{R}^n$ such that $x_A=|T_A|$ where $|T_A|$…

The goal of this research is to derive an approach to assess uncertainty in an arbitrary volume conditioned by sampling data, without using geostatistical simulation. We have accomplished this goal by deriving an numerical tool suitable for…

We investigate the inference of varifold structures in a statistical framework: assuming that we have access to i.i.d. samples in $\mathbb{R}^n$ obtained from an underlying $d$--dimensional shape $S$ endowed with a possibly non uniform…

We develop a new method to estimate the area, and more generally the intrinsic volumes, of a compact subset $X$ of $\mathbb{R}^d$ from a set $Y$ that is close in the Hausdorff distance. This estimator enjoys a linear rate of convergence as…