Related papers: The convex hull for a random acceleration process …

In 3-d the average projected area of a convex solid is 1/4 the surface area, as Cauchy showed in the 19th century. In general, the ratio in n dimensions may be obtained from Cauchy's surface area formula, which is in turn a special case of…

We consider the problem of computing Shapley values for points in the plane, where each point is interpreted as a player, and the value of a coalition is defined by the area of usual geometric objects, such as the convex hull or the minimum…

We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our framework, the…

Gaussian processes can be considered as subsets of a standard Hilbert space, but the geometric understanding that would relate the size of a set with the size of its convex hull is still lacking. In this work, we adopt a geometric approach…

We study the following range searching problem: Preprocess a set $P$ of $n$ points in the plane with respect to a set $\mathcal{O}$ of $k$ orientations % , for a constant, in the plane so that given an $\mathcal{O}$-oriented convex polygon…

We consider the problem of computing the time-convex hull of a point set under the general $L_p$ metric in the presence of a straight-line highway in the plane. The traveling speed along the highway is assumed to be faster than that off the…

We investigate the utility of the convex hull of many Lagrangian tracers to analyze transport properties of turbulent flows with different anisotropy. In direct numerical simulations of statistically homogeneous and stationary Navier-Stokes…

Consider the random polytope, that is given by the convex hull of a Poisson point process on a smooth convex body in $\mathbb{R}^d$. We prove central limit theorems for continuous motion invariant valuations including the Will's functional…

Schreiber and Yukich [Ann. Probab. 36 (2008) 363-396] establish an asymptotic representation for random convex polytope geometry in the unit ball $\mathbb{B}^d, d\geq2$, in terms of the general theory of stabilizing functionals of Poisson…

In this paper I propose very simple statistical "memory model" of one-dimensional directed polymers which is capable to store and retrieve a given random quenched trajectory. The model is defined in terms of the elastic string Hamiltonian…

This paper studies the convex hull of $d$-dimensional samples i.i.d. generated from spherically symmetric distributions. Specifically, we derive a complete integration formula for the expected facet number of the convex hull. This formula…

The convex hull of a set of points, $C$, serves to expose extremal properties of $C$ and can help identify elements in $C$ of high interest. For many problems, particularly in the presence of noise, the true vertex set (and facets) may be…

In this paper we are interested in "optimal" universal geometric inequalities involving the area, diameter and inradius of convex bodies. The term "optimal" is to be understood in the following sense: we tackle the issue of…

A novel 2-D method for computing the convex hull of a sufficiently dense set of n integer points is introduced. The approach employs a ranking function that avoids sorting the points directly thus reducing the overall time complexity. The…

Let $X_i = {X_i(t), t \in T}$ be i.i.d. copies of a centered Gaussian process $X = {X(t), t \in T}$ with values in $\mathbb{R}^d$ defined on a separable metric space $T.$ It is supposed that $X$ is bounded. We consider the asymptotic…

We prove that the convex peeling of a random point set in dimension d approximates motion by the 1/(d + 1) power of Gaussian curvature. We use viscosity solution theory to interpret the limiting partial differential equation. We use 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…

In this article, a new solution for the convex hull problem has been presented. The convex hull is a widely known problem in computational geometry. As nature is a rich source of ideas in the field of algorithms, the solution has been…

Let $K \subset \R^d$ be a smooth convex set and let $\P_\la$ be a Poisson point process on $\R^d$ of intensity $\la$. The convex hull of $\P_\la \cap K$ is a random convex polytope $K_\la$. As $\la \to \infty$, we show that the variance of…

We consider a Hamiltonian involving the range of the simple random walk and the Wiener sausage so that the walk tends to stretch itself. This Hamiltonian can be easily extended to the multidimensional cases, since the Wiener sausage is…