A canonical parameterization of paths in $\mathbb{R}^n$
L. C. Hoehn, L. G. Oversteegen, E. D. Tymchatyn

TL;DR
This paper introduces a new, well-defined path length measure called $ extsf{len}$ for all continuous paths in $R^n$, enabling a canonical parametrization and analysis of path families.
Contribution
It defines a new path length $ extsf{len}$ that is finite, continuous, and invariant, extending canonical parametrization to all continuous paths in $R^n$.
Findings
$ extsf{len}$} is finite and continuous for all continuous paths.
Provides characterizations of reparameterizable path families.
Establishes a homeomorphism between certain arc families.
Abstract
For sufficiently tame paths in , Euclidean length provides a canonical parametrization of a path by length. In this paper we provide such a parametrization for all continuous paths. This parametrization is based on an alternative notion of path length, which we call . Like Euclidean path length, is invariant under isometries of , is monotone with respect to sub-paths, and for any two points in the straight line segment between them has minimal length. Unlike Euclidean path length, the length of any path is defined (i.e., finite) and is continuous relative to the uniform distance between paths. We use this notion to obtain characterizations of those families of paths which can be reparameterized to be equicontinuous or compact. Finally, we use this parametrization to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Mathematics and Applications · Point processes and geometric inequalities
