Skip to main content
Log in

Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

We present two numerical methods to approximate the shortest path or a geodesic between two points on a three-dimensional parametric surface. The first one consists of minimizing the path length, working in the parameter domain, where the approximation class is composed of Bézier curves. In the second approach, we consider Bézier surfaces and their control net. The numerical implementation is based on finding the shortest path on the successive control net subdivisions. The convergence property of the Bézier net to the surface gives an approximation of the required shortest path. These approximations, also called pseudo-geodesics, are then applied to the creation of pseudo-geodesic meshes. Experimental results are also provided.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. C. Duflos, P. Meheut and J.C. Weill, Calcul de géodésiques par une méthode de projection, Research Report No. 0907, Inria-Roquencourt (1988).

  2. R. Kimmel, A. Amir and A.M. Bruckstein, Finding shortest paths on surfaces, in: Curves and Surfaces in Geometric Design, eds. P.-J. Laurent, A. LeMéhauté and L.L. Schumaker (A.K. Peters, Wellesley, MA, 1994) pp. 259–268.

    Google Scholar 

  3. T. Maekawa, Computation of shortest paths on free-form parametric surfaces, J. Mechanical Design 118 (1996) 499–508.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pham-Trong, V., Szafran, N. & Biard, L. Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes. Numerical Algorithms 26, 305–315 (2001). https://doi.org/10.1023/A:1016617010088

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016617010088

Keywords

Navigation