Advertisement

# Measuring Geodesic Distances via the Uniformization Theorem

• Yonathan Aflalo
• Ron Kimmel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6667)

## Abstract

According to the Uniformization Theorem any surface can be conformally mapped into a flat domain, that is, a domain with zero Gaussian curvature. The conformal factor indicates the local scaling introduced by such a mapping. This process could be used to compute geometric quantities in a simplified flat domain. For example, the computation of geodesic distances on a curved surface can be mapped into solving an eikonal equation in a plane weighted by the conformal factor. Solving an eikonal equation on the weighted plane can then be done with regular sampling of the domain using, for example, the fast marching method. The connection between the conformal factor on the plane and the surface geometry can be justified analytically. Still, in order to construct consistent numerical solvers that exploit this relation one needs to prove that the conformal factor is bounded.

In this paper we provide theoretical bounds over the conformal factor and introduce optimization formulations that control its behavior. It is demonstrated that without such a control the numerical results are unboundedly inaccurate. Putting all ingredients in the right order, we introduce a method for computing geodesic distances on a two dimensional manifold by using the fast marching algorithm on a weighed flat domain.

## Keywords

Geodesic Distance Conformal Factor Eikonal Equation Small Triangle Local Scaling
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

1. 1.
Bronstein, A., Bronstein, M., Kimmel, R.: Numerical Geometry of Non-Rigid Shapes, 1st edn. Springer, Heidelberg (2008)
2. 2.
Gu, X., Wang, S., Kim, J., Zeng, Y., Wang, Y., Qin, H., Samaras, D.: Ricci flow for 3D shape analysis. In: Proceedings of ICCV 2007, pp. 1–8 (2007)Google Scholar
3. 3.
Kimmel, R., Sethian, J.A.: Fast marching methods on triangulated domains. Proc. National Academy of Science 95, 8341–8435 (1998)
4. 4.
Lipman, Y., Funkhouser, T.: Möbius voting for surface correspondence. In: SIGGRAPH 2009: ACM SIGGRAPH 2009 Papers, pp. 1–12 (2009)Google Scholar
5. 5.
Mémoli, F., Sapiro, G.: Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces. Journal of Computational Physics 173(2), 730–764 (2001)
6. 6.
Polthier, K.: Conjugate harmonic maps and mimimal surfaces. Experimental Mathematics 2, 15–36 (1993)
7. 7.
Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. National Academy of Science 93, 1591–1595 (1996)
8. 8.
Spira, A., Kimmel, R.: An efficient solution to the eikonal equation on parametric manifolds. Interfaces and Free Boundaries 6(3), 315–327 (2004)
9. 9.
Tsitsiklis, J.N.: Efficient algorithms for globally optimal trajectories. IEEE Transactions on Automatic Control 40, 1528–1538 (1995)
10. 10.
Weber, O., Devir, Y.S., Bronstein, A., Bronstein, M., Kimmel, R.: Parallel algorithms for approximation of distance maps on parametric surfaces. ACM Trans. Graph. 104, 104:1–104:16 (2008)
11. 11.
Wolansky Incompressible, G.: quasi-isometric deformations of 2-dimensional domains. SIAM J. Imaging Sciences 2(4), 1031–1048 (2009)

## Copyright information

© Springer-Verlag Berlin Heidelberg 2012

## Authors and Affiliations

• Yonathan Aflalo
• 1
• Ron Kimmel
• 2
1. 1.Faculty of Electrical EngineeringTechnion UniversityHaifaIsrael
2. 2.Faculty of Computer ScienceTechnion UniversityHaifaIsrael

## Personalised recommendations

### Citepaper 