相关论文: A square root velocity framework for curves of bou…
The Straightness is a measure designed to characterize a pair of vertices in a spatial graph. It is defined as the ratio of the Euclidean distance to the graph distance between these vertices. It is often used as an average, for instance to…
We show that a variant of the continuous Frechet distance between polygonal curves can be computed using essentially the same algorithm used to solve the discrete version. The new variant is not necessarily monotone, but this shortcoming…
It is hereby established that, in Euclidean spaces of finite dimension, bounded self-contracted curves have finite length. This extends the main result of Daniilidis, Ley, and Sabourau (J. Math. Pures Appl. 2010) concerning continuous…
We consider two most popular definitions of velocities of remote objects in General Relativity. Our work has two motivations. From a research point of view, we generalize the formula connecting these two velocities in FRW metrics found by…
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…
Full--waveform inversion (FWI) is a method used to determine properties of the Earth from information on the surface. We use the squared Wasserstein distance (squared $W_2$ distance) as an objective function to invert for the velocity of…
We provide an algorithm of constructing a rectifiable curve between two sufficiently close points of a proximally smooth set in a uniformly convex and uniformly smooth Banach space. Our algorithm returns a reasonably short curve between two…
The Procrustes distance is used to quantify the similarity or dissimilarity of (3-dimensional) shapes, and extensively used in biological morphometrics. Typically each (normalized) shape is represented by N landmark points, chosen to be…
We propose regression models for curve-valued responses in two or more dimensions, where only the image but not the parametrization of the curves is of interest. Examples of such data are handwritten letters, movement paths or outlines of…
In this paper, we present an algorithm for reparametrizing algebraic plane curves from a numerical point of view. That is, we deal with mathematical objects that are assumed to be given approximately. More precisely, given a tolerance…
A novel static algorithm is proposed for numerical reparametrization of periodic planar curves. The method identifies a monitor function of the arclength variable with the true curvature of an open planar curve and considers a simple…
Determining the mean shape of a collection of curves is not a trivial task, in particular when curves are only irregularly/sparsely sampled at discrete points. We newly propose an elastic full Procrustes mean of shapes of (oriented) plane…
In this paper we discuss novel numerical schemes for the computation of the curve shortening and mean curvature flows that are based on special reparametrizations. The main idea is to use special solutions to the harmonic map heat flow in…
A comparison theorem for the isoperimetric profile on the universal cover of surfaces evolving by normalised Ricci flow is proven. For any initial metric, a model comparison is constructed that initially lies below the profile of the…
The traditional study of plane and space algebraic curves by looking at their tangent vectors, curvatures and torsions provides geometric, but unfortunately not sufficient information about individual curves in order to be able to…
We introduce a notion of geodesic curvature $k_{\zeta}$ for a smooth horizontal curve $\zeta$ in a three-dimensional contact sub-Riemannian manifold, measuring how much a horizontal curve is far from being a geodesic. We show that the…
Offset curves for planar trajectories are interesting in the generation of tool paths for numerically controlled industrial machines and in trajectory planning methods for autonomous driving systems. Theoretical offset curves may exhibit…
The Fr\'echet distance is a popular distance measure between trajectories or curves in space, or between walks in graphs. We study computing the Fr\'echet distance between walks in the $d$-dimensional grid graphs, i.e. $\mathbb{Z}^d$ where…
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 develop a Morse-Lusternik-Schnirelmann theory for the distance between two points of a smoothly embedded circle in a complete Riemannian manifold. This theory suggests very naturally a definition of width that generalises the classical…