A canonical parameterization of paths in \mathbb{R}^n
From MaRDI portal
Publication:5148241
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 obtain a canonical homeomorphism between certain families of arcs.
Recommendations
- The relative distance of J. D. Pryce in \({\mathbb{R}}^ 3_{\infty}\)
- Étude de certains réseaux de routes.
- scientific article; zbMATH DE number 991416
- Can we detect Gaussian curvature by counting paths and measuring their length?
- The Geodesics of Pryce’s Relative Distance in $\mathbb{R}_\infty ^2 $
- Minimal Length Curves That Are Not Embeddable in an Open Planar Set: The Problem of a Lost Swimmer with a Compass
- Lengths of a curve and the corresponding Hausdorff-type dimensions in generalized metric spaces
- The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in \(R^n\)
- Curve reconstruction, the Traveling Salesman Problem, and Menger's theorem on length
Cited in
(3)
This page was built for publication: A canonical parameterization of paths in $\mathbb{R}^n$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148241)