Geodesics of Length Less Than in a Set of Reach Are Unique and Continuous with Respect to the Endpoints
Abstract
Positive reach underpins many results in computational geometry and topology. It is used for triangulation criteria, topological inference, and manifold learning. The geometric properties of these sets have therefore been studied intensely. Here we focus on the shortest paths or minimizing geodesics in these sets. Our main result states that minimizing geodesics of length strictly less than in a set of reach are unique. This in turn implies that such minimizing geodesics are continuous with respect to the endpoints.
Keywords and phrases:
Reach, geodesics, metric geometryFunding:
Mathijs Wintraecken: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science fund (FWF) M-3073. The welcome package from IDEX of the Université Côte d’Azur, ANR-15-IDEX-01. The French National Research Agency (ANR) under grant StratMesh, ANR-24-CE48-1899.Copyright and License:
2012 ACM Subject Classification:
Theory of computation Computational geometryAcknowledgements:
We thank Jean-Daniel Boissonnat for discussion and Eddie Aamari for his insight in possible applications. We are indebted to the reviewers for many suggestion and in particular noting that Corollary 10 immediately follows from the results in our submission.Editors:
Hee-Kap Ahn, Michael Hoffmann, and Amir NayyeriSeries and Publisher:
Leibniz International Proceedings in Informatics, Schloss Dagstuhl – Leibniz-Zentrum für Informatik
1 Introduction
Federer [14] introduced the reach of a closed set as the infimum of the distance from to the medial axis , i.e. the set of points in for which the closest point in is not unique. Assumptions on the reach (and its local version the local feature size [3]) underpin the correctness of many algorithms in computational geometry and topology. In this paper we consider minimizing geodesics in this space and show that they are both unique and depend continuously on the endpoints if the geodesics are sufficiently short. Moreover, the bound on the length of the minimizing geodesics that implies uniqueness (and therefore continuity) is in fact tight, because it is attained on the sphere.
1.1 Motivation
Triangulation algorithms.
The assumption of positive reach is central to almost all triangulation algorithms, see for example [10, 12, 5], as well as manifold learning, see for example [16, 15, 2, 30]. However these algorithms often consider manifolds of positive reach instead general sets of positive reach. If we want to extend our algorithm beyond the realm of manifolds to more general stratified spaces, starting with “well behaved” sets of positive reach111Sets of positive reach are stratified spaces [14], where the stratification is understood in a weak sense. However, it is not clear that sets of positive reach are triangulable in general or additional assumptions are needed. This having been said, there are compact sets of (arbitrarily large) positive reach that are not (piecewise smoothly/linearly) homeomorphic to a finite simplicial complex, which puts this outside of the realm of computation. or at least sets of which the strata have positive (local [24]) reach understanding the geometry of those sets seems essential.
Metric learning.
Another motivation comes from metric learning. In [1] this is explained as follows:
“In the data analysis area, metric learning refers to the problem of finding a distance over the space of observations that is relevant for a given task at stake [35, 32]. For instance, in a supervised framework where one is provided with tuples of allegedly similar or dissimilar observations, the goal is to find a distance that is small on the similar tuples and large on the dissimilar ones. There is a wide range of existing methods in the literature, ranging from parametric (LSI [34], MCML [18], LDML [21] among others) to nonparametric (DMLMJ [29], kernel methods [23, 9], to cite a few).
In an unsupervised setting, metric learning aims at finding a metric that takes into account the underlying geometry of the data. That is, it amounts to estimating the shortest-path (or geodesic) distance. Often, this is done via a dimension reduction technique: any low-dimensional embedding of the data gives rise to a new distance over the data in the embedded space. Existing algorithms include PCA, t-SNE [22], MDS [11], Isomap [33], or MVU [4]. See [32] for a thorough overview of the field.”
And indeed in [1] geodesics play a crucial role in establishing optimal bounds.
1.2 Contribution
This paper focusses on the following result:
Theorem 1.
Let be a set of positive reach , then for any two points such that the geodesic distance on satisfies there is a unique minimizing geodesic in connecting and .
We stress that in the context of sets of positive reach a minimizing geodesic is a curve of minimal length connecting the two points. In this paper we only consider minimizing geodesics and therefore will not explicitly repeat “minimizing” everywhere. More generally, a geodesic is a curve such that it is locally a minimizing geodesic (between the endpoints of a subsegment). In particular more than half of great circle on a sphere, is NOT a minimizing geodesic, although they are geodesics in the more general and Riemannian setting.
The following corollary to the main theorem is perhaps even more important for applications:
Corollary 2.
Let be a set of positive reach , then the geodesic connecting any two points is continuous (in the sense) with respect to the endpoints provided that .
Both results are tight, because the bound is attained on the sphere.
1.3 Previous work
spaces.
The terminology was introduced by Gromov [20] for metric spaces that satisfy some weak form of curvature bound. We’ll now give a rough definition of spaces, but refer to [7] for a precise introduction, see Section II.1. Let be a geodesic metric space, that is a space where the length between two points is defined as the minimum of all lengths of continuous (rectifiable) curves connecting the two points, i.e. the minimum is attained. Such a minimizing curve is called a geodesic. A geodesic triangle in such a space consists of three points and the geodesics connecting those points. We can then consider a geodesic triangle with the same edge lengths in a (simply connected) space of constant curvature (that is a sphere, Euclidean space, or hyperbolic space). This triangle is called a comparison triangle. We say that the diameter of a simply connected space of constant curvature is if and otherwise. We also refer to this as the diameter of the comparison space. This geodesic triangle in satisfies the inequality if the distances between the points on the triangle are less than the corresponding distances between points on the comparison triangle in a space of constant curvature . If this holds for any geodesic triangle of diameter less than the diameter of the comparison space, then we say that the entire space is .
Sets of positive reach as spaces.
Lytchak [25, 26] proved sets of positive reach are , for some . Because in (simply connected) spaces of constant curvature, geodesic triangles with small diameter and one edge length equal to zero consist of two coinciding edges, the uniqueness of sufficiently small geodesics follows directly from Lytchak’s result. However, from a computational perspective the result of Lytchak is ineffective, because we only know that such a constant exists and not what this constant may be.
1.4 Further motivation and future work
Many questions on the geometry of sets of positive reach and the behaviour of geodesics in sets of positive reach of course remain open. Determining the for which a set of reach is , would be an important next step, which in fact motivated this work to a large extent. We conjecture that .
If we may engage in some speculation, establishing the property would potentially:
-
Help establish bounds on angles between tangent cones of sets of positive reach, beyond the manifold setting, which is in turn essential for stratification learning.
-
Help establish convergence rates for algorithms to compute geodesics in sets of positive reach.
2 Result
2.1 Notation
We’ll denote sets of positive reach by and the closest point projection by . We use the notation for a ball in Euclidean spaces with centre and radius . Curves are generally denoted by and most importantly:
We’ll use Newton’s notation for the derivatives of curves that is, .
2.2 Uniqueness
The main idea of the proof is the following: Suppose that there are two geodesics and connecting two points is not unique then we can move the geodesic a little in the direction , shortening the geodesic and thus yielding a contradiction. This perturbed geodesic, of course, needs to lie on the set of positive reach, which will be achieved by closest point projection onto the set of positive reach. We commence our proof with a couple of lemmas that will be instrumental in dealing with this projection.
We first recall a convexity result from [6]. We recall that a set is geodesically convex if for any two points the geodesic connecting and is contained in .
Corollary 3 (Corollary 1 of [6]).
Let be a closed set with positive reach . Then, for any and any then is geodesically convex in .
Lemma 4.
Let have reach and assume with . Define . We have that
with the Euclidean distance.
Proof.
Corollary 3 implies that the geodesic connecting and is contained in the intersection of all balls of radius less than the reach that contain and so that in particular the geodesic is contained in the spindle (the intersection of all balls of radius in Euclidean space that contain and ), as depicted in Figure 1. This implies in turn that less than or equal to the distance from to the boundary of the spindle. Let’s restrict ourselves to the plane given by , , and and consider a circle of radius with centre that yields the boundary of the spindle in this plane, see again Figure 1. By the cosine rule have that
where (the value for follows by inspection of the triangle with vertices , , and ). So that
The first inequality now follows by observing that the distance from to the spindle is given by , see Figure 1. The second inequality follows from the standard observation that , which in turn follows by Taylor’s theorem.
We’ll need the following corollary of [14, Theorem 4.8(8)]. Theorem 4.8(8) of [14] says the closest point projection at a point is -Lipschitz. We therefore immediately have:
Corollary 5.
If is a curve, then the length of is upper bounded as follows
| (1) |
The following simple but very useful bound will be instrumental in the proof below.
Lemma 6.
If and are two unit vectors we have that
For vectors of arbitrary length we have
Proof.
We have that for any two unit vectors that:
| (2) | ||||
| (using that ) | ||||
| (3) | ||||
| (using that ) |
and thus
For of arbitrary length we combine (2) and (3) as follows
Theorem 1. [Restated, see original statement.]
Let be a set of positive reach , then for any two points such that the geodesic distance on satisfies there is a unique minimizing geodesic in connecting and .
Overview of the proof.
The core idea of the proof is the following: Given two geodesics and connecting that are parametrized by arc length we have that is shorter than and because , if . So222Here abuse notation a little bit because we do not distinguish the notation for a geodesic and its parametrization. if we would find a contradiction, because there would be a curve connecting and that would be shorter than a geodesic. The main difficulty of the proof is that is generally not in , but we need to project on to find a curve that is. The technical difficulty lies with dealing with this projection.
The proof, perhaps surprisingly, also relies on a result from mathematical physics. Consider the Lagrangian of the (real) harmonic oscillator:
Write for the action, that is
| (4) |
The Euler-Lagrange equation,
in this case yields
with the familiar solutions . We have the following, see [19, Section V], [28] for this specific result333Note that our the Lagrangian of a high dimensional harmonic oscillator (with constant potential) is the sum of one-dimensional harmonic oscillators. and [17] for general theory:
Theorem 7 (Adjusted from [19] and [28]).
The solution to the Euler-Lagrange equation of the harmonic oscillator is a global minimum of the action (4) provided that .
This means in particular that:
Corollary 8.
Let be a constant. If and is a function that satisfies and , then we have that
Proof of Theorem 1.
Because the geodesic distance between and is finite, which means that there exists a path of finite length connecting and in . Moreover, thanks to the second paragraph of part III, section 1: “Die Existenz geodätischer Bogen in metrischen Räume” in [27], we have that: If there is at least one path between and with finite length, then a minimizing geodesic, i.e. a path with minimal length connecting to , exists. Therefore the set of minimizing geodesics is not empty.
Let be two length minimizing paths from to , parametrized by arc length, with same length: .
Denote by the maximal distance between and , i.e.
| (5) |
and let be a parameter for this distance is attained, that is,
Without loss of generality, we assume that .
We now consider the two families of curves
and
We now upper bound the length . By Lemma 4 we have that
Using Corollary 5 this yields that
| (6) |
We now focus on the second term in the product in the integral.
With Lemma 6 we find the following bound on (6):
| (7) |
Assuming that is very small (more precisely we’ll show that the length decreases in first order near or ) yields that
| (by Taylor) | ||||
| (8) |
Now writing and thus , this integral (ignoring the higher order terms) takes the form of a familiar Lagrangian integral or action
| (9) |
which we recognize (up to global additive and multiplicative factors) as the action integral of the harmonic oscillator. To achieve better bounds we’ll now split this into two integrals
We’ll only concentrate on the first integral, the second one can be treated in a completely symmetrical manner.
We now invoke Theorem 7 and Corollary 8, with , together with (7), (8), and (9), to find that
(the follows because is negative)
where is some constant. This is strictly less than , as long as . This contradicts the assumption that the geodesics have length (which is the sum of the integral from to and the integral from to ), because now we found a curve that is shorter up to first order.
2.3 Continuity
The uniqueness of the geodesics of length less than implies continuity for geodesics under the same restriction. The proof of the continuity will rely heavily on the Arzelà-Ascoli theorem, see e.g. [13]. To this end we have to recall some nomenclature: A sequence of continuous functions on an interval is uniformly bounded if for all and all , we have that , with some (universal) constant. The sequence is uniformly equicontinuous if, for every there exists a , such that for all satisfying and all we have that
The theorem can now be stated as
Theorem 9 (Arzelà-Ascoli).
Let be a sequence of real-valued uniformly bounded, equicontinuous functions on a compact interval . Then there exists a subsequence that converges uniformly.
With these preliminaries out of the way we can state the second contribution of the paper: See 2
We provide two proofs, one here and another in the appendix. Although they share a fair number of common techniques they differ significantly on the way that they treat the length of the limit curve. Moreover, the proof here is shorter, but requires some familiarity with using the Arzelà-Ascoli theorem, while the proof in the appendix discusses this in greater detail.
Proof.
Let , be a pair of sequences of points in , where and , as well as a sequence of geodesics , connecting and . Let be the minimizing geodesic connecting and .
We want to prove that , where denotes the norm (i.e. sup norm). In other words, we have to prove that, for any , the cardinal of the set:
is finite.
Assume to achieve a contradiction that the cardinal of is infinite. Since the set of functions in is bounded and equicontinuous (because they admit a uniform Lipschitz constant), we can apply Arzelà-Ascoli theorem and find a subsequence converging to a curve in . Since one has .
By a classical result [8, Claim 5.8, page 19], the length of the limit cannot be larger than the limit inf of lengths which yields . Therefore, would be a geodesic between and with which contradicts the unicity of geodesics stated in Theorem 1.
Corollary 2 has itself another consequence which is worth pointing out.
Corollary 10.
A geodesic ball of radius less than is contractible.
Proof.
Write , for the geodesic ball in with centre and radius , where . Let , and let be the geodesic parametrized by with constant arclength with and . Thanks to Corollary 2 the geodesics are continuous under the -norm, with respect to endpoint . This means that the map is a (continuous) homotopy.
References
- [1] Eddie Aamari, Clément Berenfeld, and Clément Levrard. Optimal reach estimation and metric learning. The Annals of Statistics, 51(3):1086–1108, 2023.
- [2] Eddie Aamari and Clément Levrard. Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction. Discrete & Computational Geometry, 59(4):923–971, 2018. doi:10.1007/s00454-017-9962-z.
- [3] N. Amenta and M. Bern. Surface reconstruction by Voronoi filtering. Discrete & Computational Geometry, 22(4):481–504, December 1999. doi:10.1007/PL00009475.
- [4] Ery Arias-Castro and Bruno Pelletier. On the convergence of maximum variance unfolding. The Journal of Machine Learning Research, 14(1):1747–1770, 2013. doi:10.5555/2567709.2567719.
- [5] Jean-Daniel Boissonnat, Frédéric Chazal, and Mariette Yvinec. Geometric and Topological Inference. Cambridge Texts in Applied Mathematics. Cambridge University Press, 2018. doi:10.1017/9781108297806.
- [6] Jean-Daniel Boissonnat, André Lieutier, and Mathijs Wintraecken. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology, 3(1):29–58, June 2019. doi:10.1007/s41468-019-00029-8.
- [7] Martin R Bridson and André Haefliger. Metric spaces of non-positive curvature, volume 319 of Grundlehren der mathematischen Wissenschaften. Springer Science & Business Media, 2013.
- [8] H. Busemann. The geometry of geodesics. Dover Publications, 2005.
- [9] Ratthachat Chatpatanasiri, Teesid Korsrilabutr, Pasakorn Tangchanachaianan, and Boonserm Kijsirikul. A new kernelization framework for Mahalanobis distance learning algorithms. Neurocomputing, 73(10-12):1570–1579, 2010. doi:10.1016/J.NEUCOM.2009.11.037.
- [10] S.-W. Cheng, T.K. Dey, and J.R. Shewchuk. Delaunay Mesh Generation. Computer and information science series. CRC Press, 2013.
- [11] Michael AA Cox and Trevor F Cox. Multidimensional scaling. In Handbook of data visualization, pages 315–347. Springer, 2008.
- [12] T.K. Dey. Curve and Surface Reconstruction: Algorithms with Mathematical Analysis. Number 23 in Cambridge monographs on applied and computational mathematics. Cambridge University Press, 2007.
- [13] Nelson Dunford and Jacob T Schwartz. Linear operators, part 1: general theory. John Wiley & Sons, 1988.
- [14] H. Federer. Curvature measures. Transactions of the American Mathematical Society, 93:418–491, 1959.
- [15] Charles Fefferman, Sergei Ivanov, Yaroslav Kurylev, Matti Lassas, and Hariharan Narayanan. Reconstruction and interpolation of manifolds. I: The geometric Whitney problem. Foundations of Computational Mathematics, 2019. doi:10.1007/s10208-019-09439-7.
- [16] Charles Fefferman, Sergei Ivanov, Matti Lassas, and Hariharan Narayanan. Fitting a manifold of large reach to noisy data. arXiv e-prints, page arXiv:1910.05084, October 2019. arXiv:1910.05084.
- [17] Izrail Moiseevitch Gelfand and Richard A Silverman. Calculus of variations. Courier Corporation, 2000.
- [18] Amir Globerson and Sam T. Roweis. Metric learning by collapsing classes. In Advances in Neural Information Processing Systems, volume 18, 2005.
- [19] C. G. Gray and Edwin F. Taylor. When action is not least. American Journal of Physics, 75(5):434–458, May 2007. doi:10.1119/1.2710480.
- [20] Mikhael Gromov. Hyperbolic groups. In Essays in group theory, pages 75–263. Springer, 1987.
- [21] Matthieu Guillaumin, Jakob Verbeek, and Cordelia Schmid. Is that you? Metric learning approaches for face identification. In 2009 IEEE 12th International Conference on Computer Vision, pages 498–505. IEEE, 2009. doi:10.1109/ICCV.2009.5459197.
- [22] Geoffrey Hinton and Sam T. Roweis. Stochastic neighbor embedding. In Advances in Neural Information Processing Systems, volume 15, 2002.
- [23] James T. Kwok and Ivor W. Tsang. Learning with idealized kernels. In Proceedings of the International Conference on Machine Learning (ICML), pages 400–407, 2003. URL: http://www.aaai.org/Library/ICML/2003/icml03-054.php.
- [24] André Lieutier and Mathijs Wintraecken. Manifolds of positive reach, differentiability, tangent variation, and attaining the reach. In Hee-Kap Ahn, Michael Hoffmann, and Amir Nayyeri, editors, 42nd International Symposium on Computational Geometry (SoCG 2026), volume 367 of Leibniz International Proceedings in Informatics (LIPIcs), pages 75:1–75:16, Dagstuhl, Germany, 2026. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
- [25] Alexander Lytchak. On the geometry of subsets of positive reach. Manuscripta mathematica, 115(2):199–205, 2004.
- [26] Alexander Lytchak. Almost convex subsets. Geometriae Dedicata, 115(1):201–218, 2005.
- [27] K. Menger. Untersuchungen über allgemeine Metrik. Vierte Untersuchung. Zur Metrik der Kurven. Mathematische Annalen, 103:466–501, 1930.
- [28] M. Moriconi. Condition for minimal harmonic oscillator action. American Journal of Physics, 85(8):633–634, August 2017. doi:10.1119/1.4984778.
- [29] Bac Nguyen, Carlos Morell, and Bernard De Baets. Supervised distance metric learning through maximization of the Jeffrey divergence. Pattern Recognition, 64:215–225, 2017. doi:10.1016/J.PATCOG.2016.11.010.
- [30] Barak Sober and David Levin. Manifold approximation by moving least-squares projection (MMLS). Constructive Approximation, pages 1–46, 2019. doi:10.1007/s00365-019-09489-8.
- [31] M. Spivak. A comprehensive introduction to differential geometry: Volume I. Publish or Perish, 1999.
- [32] José L. Suárez, Salvador García, and Francisco Herrera. A tutorial on distance metric learning: Mathematical foundations, algorithms, experimental analysis, prospects and challenges. Neurocomputing, 425:300–322, 2021. doi:10.1016/J.NEUCOM.2020.08.017.
- [33] Joshua B. Tenenbaum, Vin de Silva, and John C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319–2323, 2000.
- [34] Eric P. Xing, Andrew Y. Ng, Michael I. Jordan, and Stuart J. Russell. Distance metric learning, with application to clustering with side-information. In Advances in Neural Information Processing Systems, volume 15, 2002.
- [35] Liu Yang and Rong Jin. Distance metric learning: A comprehensive survey. Technical Report MSU-CSE-06-2, Michigan State University, 2006.
Appendix A Alternative proof
Alternative proof of Corollary 2.
Assume that the geodesics are not continuous with respect to the endpoints, then there exist an and a pair of sequences of points , , where and , as well as a sequence of geodesics , connecting and such that
where is the geodesic connecting and . We stress that here we parametrize the geodesics on the unit interval , with constant norm of the tangent vector, i.e. .
We further note that thanks to the metric characterization of sets of positive reach [6, Theorem 1] convergence in the Euclidean and geodesic sense are equivalent.
Again, thanks to the metric characterization of sets of positive reach [6, Theorem 1] we know that geodesics are themselves sets of (at least) the same reach as the set in which they lie. We also know that manifolds of positive reach are where the Lipschitz constant of the derivative is bounded by , see [24]. This implies that the tangent vectors are uniformly Lipschitz, that is Lipschitz with the same Lipschitz constant for all . This uniform Lipschitz constant implies by definition uniform equicontinuity of . Because all geodesics are parametrized according to arclength, with , and is bounded by assumption, is also bounded.
We now observe that by passing to a subsequence we can assume that there is one such that
| (10) |
This can be seen as follows: Because is compact the supremum must be attained at some point for each . Again because is compact this sequence of points must have a convergent subsequence with limit because of smoothness (more precisely, the fact that is bounded) of , we have that for sufficiently large and sufficiently small, we have . This implies that (10) holds.
Now we can invoke the Arzelà-Ascoli theorem to conclude that there exist a , which is the limit of a convergent subsequence of . We write . With this notation we can formulate the following observations:
-
The lengths of converge to the length of .
-
The geodesic has to converge to the geodesic distance between and , because by the triangle inequality we have that
And hence, and both are geodesics, that is their lengths equal the geodesic distance between the endpoints.
-
, in particular .
This yields a contradiction with the uniqueness of the geodesics, that is Theorem 1.
