Related papers: Mean distance in polyhedra
Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…
In many robotics applications, it is necessary to compute not only the distance between the robot and the environment, but also its derivative - for example, when using control barrier functions. However, since the traditional Euclidean…
We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…
We prove that if the shape of the metric unit ball in a homogeneous group enjoys a precise symmetry property, then the associated distance yields the standard form of the area formula. The result applies to some classes of smooth and…
Let P_1 and P_2 be two sets of points in the plane, so that P_1 is contained in a line L_1, P_2 is contained in a line L_2, and L_1 and L_2 are neither parallel nor orthogonal. Then the number of distinct distances determined by the pairs…
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter provides a…
A random motion on the Poincar\'e half-plane is studied. A particle runs on the geodesic lines changing direction at Poisson-paced times. The hyperbolic distance is analyzed, also in the case where returns to the starting point are…
We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute,…
A finite set of unlabelled points in Euclidean space is the simplest representation of many real objects from mineral rocks to sculptures. Since most solid objects are rigid, their natural equivalence is rigid motion or isometry maintaining…
In this short paper, an older Efron's result is extended to obtain a cutting plane integral formula for the mean volume of a random simplex in any d dimensions.
A common measure of a function's complexity is the count of its stationary points. For complicated functions, this count grows exponentially with the volume and dimension of their domain. In practice, the count is averaged over a class of…
We study the regularity of the distance function to the boundary of a domain in $\mathbb{R}^n$, with respect to the Minkowski functional of a convex polytope. We obtain the regularity of the distance function in certain cases. We also…
For each $d>0$, we find all the smallest fullerenes for which the least distance between two pentagons is $d$. We also show that for each $d$ there is an $h_d$ such that fullerenes with pentagons at least distance $d$ apart and any number…
Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the…
We introduce a natural notion of mean (or average) distance in the context of compact metric graphs, and study its relation to geometric properties of the graph. We show that it exhibits a striking number of parallels to the reciprocal of…
We study different ways of determining the mean distance $ < r_n >$ between a reference point and its $n$-th neighbour among random points distributed with uniform density in a $D$-dimensional Euclidean space. First we present a heuristic…
Wasserstein distances provide a metric on a space of probability measures. We consider the space $\Omega$ of all probability measures on the finite set $\chi = \{1, \dots ,n\}$ where $n$ is a positive integer. 1-Wasserstein distance,…
It is known that the flip distance between two triangulations of a convex polygon is related to the minimum number of tetrahedra in the triangulation of some polyhedron. It is interesting to know whether these two numbers are the same. In…
The Platonic solids is the name traditionally given to the five regular convex polyhedra, namely the tetradron, the octahedron, the cube, the icosahedron and the dodecahedron. Perhaps strongly boosted by the towering historical influence of…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…