Related papers: A distance on curves modulo rigid transformations
In [Computer Aided Geometric Design 27 (2010), 212-231] the authors present an algorithm to parametrize approximately $\epsilon$-rational curves, and they show in 2 examples that the Hausdorff distance, w.r.t. to the Euclidean distance,…
This is the first part of a general description in terms of mass transport for time-evolving interacting particles systems, at a mesoscopic level. Beyond kinetic theory, our framework naturally applies in biology, computer vision, and…
The width $w$ of a curve $\gamma$ in Euclidean space $R^n$ is the infimum of the distances between all pairs of parallel hyperplanes which bound $\gamma$, while its inradius $r$ is the supremum of the radii of all spheres which are…
The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight segments of lengths equal (or as close as possible) to the…
We consider the curves whose all normal planes are at the same distance from a fixed point and obtain some characterizations of them in the 3-dimensional Euclidean space.
In the shape analysis approach to computer vision problems, one treats shapes as points in an infinite-dimensional Riemannian manifold, thereby facilitating algorithms for statistical calculations such as geodesic distance between shapes…
We present a quantum theory of distances along a curve, based on a linear line element that is equal to the operator square root of the quadratic metric of Riemannian geometry. Since the linear line element is an operator, we treat it…
On a manifold or a closed subset of a Euclidean vector space, a retraction enables to move in the direction of a tangent vector while staying on the set. Retractions are a versatile tool to perform computational tasks such as optimization,…
We consider the path space of a curved manifold on which a point particle is introduced in a conservative physical system with constant total energy to formulate its action functional and geodesic equation together with breaks on the path.…
In a field-theoretical context, we consider the Euclidean $(\phi^4+\phi^6)_D$ model compactified in one of the spatial dimensions. We are able to determine the dependence of the transition temperature ($T_{c}$)for a system described by this…
We discuss how the shape of a special Cosserat rod can be represented as a path in the special Euclidean algebra. By shape we mean all those geometric features that are invariant under isometries of the three-dimensional ambient space. The…
The Fr\'echet distance is a popular similarity measure that is well-understood for polygonal curves in $\mathbb{R}^d$: near-quadratic time algorithms exist, and conditional lower bounds suggest that these results cannot be improved…
The Frechet distance is a metric to compare two curves, which is based on monotonous matchings between these curves. We call a matching that results in the Frechet distance a Frechet matching. There are often many different Frechet…
The paper presents a discrete variation of the Frechet distance between closed curves, which can be seen as an approximation of the continuous measure. A rather straightforward approach to compute the discrete Frechet distance between two…
We study the motion-planning problem for a car-like robot whose turning radius is bounded from below by one and which is allowed to move in the forward direction only (Dubins car). For two robot configurations $\sigma, \sigma'$, let…
We present an algorithm to compute the minimum orbital intersection distance (MOID), or global minimum of the distance between the points lying on two Keplerian ellipses. This is achieved by finding all stationary points of the distance…
The geodesic has a fundamental role in physics and in mathematics: roughly speaking, it represents the curve that minimizes the arc length between two points on a manifold. We analyze a basic but misinterpreted difference between the…
One approach to studying the Fr\'echet distance is to consider curves that satisfy realistic assumptions. By now, the most popular realistic assumption for curves is $c$-packedness. Existing algorithms for computing the Fr\'echet distance…
We extend a newly developed formal system for the description of astrophysical maps. In this formalism, we consider the difference between maps to be the distance between elements of a pseudometric space (the space of all such maps). This…
We introduce a rotation-invariant representation of planar shapes. In particular, this representation encodes shapes as vectors such that the Euclidean distance between them serves as a valid shape distance. For standardized, star-shaped…