Related papers: Optimal reparametrizations in the square root velo…
Any quasi-isometry of the complex of curves is bounded distance from a simplicial automorphism. As a consequence, the quasi-isometry type of the curve complex determines the homeomorphism type of the surface.
We study some Riemannian metrics on the space of regular smooth curves in the plane, viewed as the orbit space of maps from $S^1$ to the plane modulo the group of diffeomorphisms of $S^1$, acting as reparameterizations. In particular we…
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…
We show that for some negatively curved solvable Lie groups, all self quasiisometries are almost isometries. We prove this by showing that all self quasisymmetric maps of the ideal boundary (of the solvable Lie groups) are bilipschitz with…
Regularization is used in many different areas of optimization when solutions are sought which not only minimize a given function, but also possess a certain degree of regularity. Popular applications are image denoising, sparse regression…
We propose a learning framework for graph kernels, which is theoretically grounded on regularizing optimal transport. This framework provides a novel optimal transport distance metric, namely Regularized Wasserstein (RW) discrepancy, which…
We give a new characterisation of the unparametrised geodesics, or distinguished curves, for affine, pseudo-Riemannian, conformal, and projective geometry. This is a type of moving incidence relation. The characterisation is used to provide…
In this work, we study plane and spherical curves in Euclidean and Lorentz-Minkowski 3-spaces by employing rotation minimizing (RM) frames. By conveniently writing the curvature and torsion for a curve on a sphere, we show how to find the…
Let $M$ be a smooth manifold, $F$ be a smooth vector field on $M$, and $F_t$ be the local flow of $F$. Denote by $Sh(F)$ the space of smooth maps $h:M\to M$ of the following form: $h(x) = F_{f(x)}(x)$, where $f:M\to\mathbb{R}$ runs over all…
We consider pairs of a non-empty compact connected and locally connected Hausdorff space and a real-valued continuous function. Our aim is to measure the difference between this kind of the pairs. In this notes we introduce new…
Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…
The signature transform, defined by the formal tensor series of global iterated path integrals, is a homomorphism between the path space and the tensor algebra that has been studied in geometry, control theory, number theory as well as…
In well-studied graph modification problems, adding and deleting vertices and edges are used as graph editing operations. We propose a model for graph modification on geometric intersection graphs called Geometric Graph Edit Distance that…
In the recent paper "Reparametrizations of continuous paths", J. Homotopy Relat. Struct. 2 (2007), 93-117 (with U. Fahrenberg), we performed a systematic investigation of reparametrizations of continuous paths in a Hausdorff space that…
Shape analysis is ubiquitous in problems of pattern and object recognition and has developed considerably in the last decade. The use of shapes is natural in applications where one wants to compare curves independently of their…
In the elastic shape analysis approach to shape matching and object classification, plane curves are represented as points in an infinite-dimensional Riemannian manifold, wherein shape dissimilarity is measured by geodesic distance. A…
Model reparametrization, which follows the change-of-variable rule of calculus, is a popular way to improve the training of neural nets. But it can also be problematic since it can induce inconsistencies in, e.g., Hessian-based flatness…
Given a non-rational real space curve and a tolerance $\epsilon>0$, we present an algorithm to approximately parametrize the curve. The algorithm checks whether a planar projection of the space curve is $\epsilon$-rational and, in the…
We initiate the study of diameter computation in geometric intersection graphs from the fine-grained complexity perspective. A geometric intersection graph is a graph whose vertices correspond to some shapes in $d$-dimensional Euclidean…
We address in this paper the study of a geometric evolution, corresponding to a curvature which is non-local and singular at the origin. The curvature represents the first variation of the energy recently proposed as a variant of the…