Related papers: Optimal reparametrizations in the square root velo…
The Wasserstein-Fisher-Rao (WFR) distance on $S^{2}$ has recently been shown to coincide with a classical elastic distance between $S^{2}$-immersions in the theory of Riemannian shape analysis. While this correspondence holds in dimension…
In motion planning problems for autonomous robots, such as self-driving cars, the robot must ensure that its planned path is not in close proximity to obstacles in the environment. However, the problem of evaluating the proximity is…
An algorithm framework is proposed for minimizing nonsmooth functions. The framework is variable-metric in that, in each iteration, a step is computed using a symmetric positive definite matrix whose value is updated as in a quasi-Newton…
We study a variational framework to compare shapes, modeled as Radon measures on R^N, in order to quantify how they differ from isometric copies. To this purpose we discuss some notions of weak deformations termed reformations as well as…
We propose a geometric method for quantifying the difference between parametrized curves in Euclidean space by introducing a distance function on the space of parametrized curves up to rigid transformations (rotations and translations).…
Surface comparison and matching is a challenging problem in computer vision. While reparametrization-invariant Sobolev metrics provide meaningful elastic distances and point correspondences via the geodesic boundary value problem, solving…
The notion of reparametrizations of Weighted CSPs (WCSPs) (also known as equivalence-preserving transformations of WCSPs) is well-known and finds its use in many algorithms to approximate or bound the optimal WCSP value. In contrast, the…
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…
The symmetries of paths in a manifold $M$ are classified with respect to a given pointwise proper action of a Lie group $G$ on $M$. Here, paths are embeddings of a compact interval into $M$. There are at least two types of symmetries:…
For a rational parameterization of a curve, it is desirable that its angular speed is as uniform as possible. Hence, given a rational parameterization, one wants to find re-parameterization with better uniformity. One natural way is to use…
We define $\partial$-biLipschitz homeomorphisms between uniform metric spaces and show that these maps are always quasim\"obius. We also show that a homeomorphism being $\partial$-biLipschitz is equivalent to the map biLipschitz in the…
The radius and diameter are fundamental graph parameters. They are defined as the minimum and maximum of the eccentricities in a graph, respectively, where the eccentricity of a vertex is the largest distance from the vertex to another…
Geometric frameworks for analyzing curves are common in applications as they focus on invariant features and provide visually satisfying solutions to standard problems such as computing invariant distances, averaging curves, or registering…
We provide a new angle and obtain new results on a class of metrics on length-normalized curves in $d$ dimensions, represented by their unit tangents expressed as a function of arc-length, which are functions from the unit interval to the…
Non-smoothness at optimal points is a common phenomenon in many eigenvalue optimization problems. We consider two recent algorithms to minimize the largest eigenvalue of a Hermitian matrix dependent on one parameter, both proven to be…
We develop a cut finite element method for the Bernoulli free boundary problem. The free boundary, represented by an approximate signed distance function on a fixed background mesh, is allowed to intersect elements in an arbitrary fashion.…
The computation of the elastic shape registration of two simple surfaces in 3-dimensional space and therefore of the elastic shape distance between them has been investigated by Kurtek, Jermyn, et al. who have proposed algorithms to carry…
For Bezier curves, subdivision algorithms create control polygons as piecewise linear (PL) approximations that converge in terms of Hausdorff distance. We prove that the exterior angles of control polygons under subdivision converge to 0 at…
Erratum, 11 July 2022: This is an updated version of the original paper in which the notion of reparametrization category was incorrectly axiomatized. Details on the changes to the original paper are provided in the Appendix. A…
Spherical regression explores relationships between variables on spherical domains. We develop a nonparametric model that uses a diffeomorphic map from a sphere to itself. The restriction of this mapping to diffeomorphisms is natural in…