相关论文: The convex hull for a random acceleration process …
We study the convex hull of the set of points visited by a two-dimensional random walker of T discrete time steps. Two natural observables that characterize the convex hull in two dimensions are its perimeter L and area A. While the mean…
We investigate the statistics of the convex hull for a single run-and-tumble particle in two dimensions. Run-and-tumble particle, also known as persistent random walker, has gained significant interest in the recent years due to its…
In this paper we study the statistical properties of convex hulls of $N$ random points in a plane chosen according to a given distribution. The points may be chosen independently or they may be correlated. After a non-exhaustive survey of…
We study the statistical properties of the convex hull of a planar run-and-tumble particle (RTP), also known as the "persistent random walk", where the particle/walker runs ballistically between tumble events at which it changes its…
In this article we study the convex hull spanned by the union of trajectories of a standard planar Brownian motion, and an independent standard planar Brownian bridge. We find exact values of the expectation of perimeter and area of such a…
We compute exactly the mean perimeter and the mean area of the convex hull of a $2$-d Brownian motion of duration $t$ and diffusion constant $D$, in the presence of resetting to the origin at a constant rate $r$. We show that for any $t$,…
Given a set $P$ of $n$ points in the plane, we study the computation of the probability distribution function of both the area and perimeter of the convex hull of a random subset $S$ of $P$. The random subset $S$ is formed by drawing each…
We investigate the geometric properties of the convex hull over $n$ successive positions of a planar random walk, with a symmetric continuous jump distribution. We derive the large $n$ asymptotic behavior of the mean perimeter. In addition,…
We investigate several computational problems related to the stochastic convex hull (SCH). Given a stochastic dataset consisting of $n$ points in $\mathbb{R}^d$ each of which has an existence probability, a SCH refers to the convex hull of…
An incremental approach for computation of convex hull for data points in two-dimensions is presented. The algorithm is not output-sensitive and costs a time that is linear in the size of data points at input. Graham's scan is applied only…
A remarkable result from integral geometry is Cauchy's formula, which relates the mean path length of ballistic trajectories randomly crossing a convex 2D domain, to the ratio between the region area and its perimeter. This theorem has been…
We compute exactly the mean perimeter and area of the convex hull of N independent planar Brownian paths each of duration T, both for open and closed paths. We show that the mean perimeter < L_N > = \alpha_N, \sqrt{T} and the mean area…
For a broad class of planar Markov processes, viz. L\'evy processes satisfying certain conditions (valid \textit{eg} in the case of Brownian motion and L\'evy flights), we establish an exact, universal formula describing the shape of the…
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, an effective method with time complexity of $\mathcal{O}(K^{3/2}N^2\log \frac{K}{\epsilon_0})$ is introduced to find an approximation of the convex hull for $N$ points in dimension $n$, where $K$ is close to the number of…
We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…
We study various properties of the convex hull of a planar Brownian motion, defined as the minimum convex polygon enclosing the trajectory, in the presence of an infinite reflecting wall. Recently, in a Rapid Communication [Phys. Rev. E…
We establish bounds on expected values of various geometric quantities that describe the size of the convex hull spanned by a path of the standard planar Brownian motion. Expected values of the perimeter and the area of the Brownian convex…
The convex hull describes the extent or shape of a set of data and is used ubiquitously in computational geometry. Common algorithms to construct the convex hull on a finite set of n points (x,y) range from O(nlogn) time to O(n) time.…
Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…