相关论文: The convex hull for a random acceleration process …

Region extraction is necessary in a wide range of applications, from object detection in autonomous driving to analysis of subcellular morphology in cell biology. There exist two main approaches: convex hull extraction, for which exact and…

Consider the triangle $T$ with vertices $(0,0)$, $(0,1)$, and $(1,0)$. The lower boundary of the convex hull of $(0,1)$, $(1,0)$, together with $n$ independent uniformly distributed random points in $T$, is called a random convex chain and…

We consider the motion of a randomly accelerated particle in one dimension under stochastic resetting mechanism. Denoting the position and velocity by $x$ and $v$ respectively, we consider two different resetting protocols - (i) complete…

This paper presents an alternate choice of computing the convex hulls (CHs) for planar point sets. We firstly discard the interior points and then sort the remaining vertices by x- / y- coordinates separately, and later create a group…

We present an exact two-particle solution of the Currie-Hill equations of Predictive Relativistic Mechanics in $1 + 1$ dimensional Minkowski space. The instantaneous accelerations are given in terms of elementary functions depending on the…

The relative dispersion process in two-dimensional free convection turbulence is investigated by direct numerical simulation. In the inertial range, the growth of relative separation, $r$, is expected as $<r^2(t)>\propto t^5$ according to…

We present new algorithms to perform fast probabilistic collision queries between convex as well as non-convex objects. Our approach is applicable to general shapes, where one or more objects are represented using Gaussian probability…

There is currently a gap in theory for point patterns that lie on the surface of objects, with researchers focusing on patterns that lie in a Euclidean space, typically planar and spatial data. Methodology for planar and spatial data thus…

The relativistic analysis of stochastic kinematics is developed in order to determine the transformation of the effective diffusivity tensor in inertial frames. Poisson-Kac stochastic processes are initially considered. For one-dimensional…

We study the asymptotic behaviour of the most likely trajectories of a planar random walk that result in large deviations of the area of their convex hull. If the Laplace transform of the increments is finite on $R^2$, such a scaled limit…

We consider a class of random quantum circuits where at each step a gate from a universal set is applied to a random pair of qubits, and determine how quickly averages of arbitrary finite-degree polynomials in the matrix elements of the…

Constant workspace algorithms use a constant number of words in addition to the read-only input to the algorithm. In this paper, we devise algorithms to efficiently compute relative hulls in the plane using a constant workspace.…

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…

We study the geometry of infinite random Boltzmann planar maps having weight of polynomial decay of order $k^{-2}$ for each vertex of degree $k$. These correspond to the dual of the discrete "stable maps" of Le Gall and Miermont [Scaling…

We describe the rate of growth of the derivative $C'$ of the convex minorant of a L\'evy path at times where $C'$ increases continuously. Since the convex minorant is piecewise linear, $C'$ may exhibit such behaviour either at the vertex…

In this paper, a stochastic alternating direction method of multipliers (ADMM) is proposed for a class of nonsmooth composite and stochastic convex optimization problems in Hilbert space, motivated by optimization problems constrained by…

This paper deals with determination of turbulent convection velocities from particle image velocimetry (PIV). Turbulent convection velocities are of interest because they can be used to map temporal information into space. Convection…

We study a process termed "agglomerative percolation" (AP) in two dimensions. Instead of adding sites or bonds at random, in AP randomly chosen clusters are linked to all their neighbors. As a result the growth process involves a diverging…

Let C = C(l_1, ..., l_n) be the n-dimensional orthogonal cross-polytope whose axes are of length l_1,..., l_n. Subject to the condition \sum l_i^2 = 1, the mean width of C is minimised when l_i = 1/sqrt{n} for every i, and it is maximised…

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…