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

DOI10.1023/A:1016617010088MaRDI QIDQ5934381zbMATH OpenOpenAlexFDO

Authors Valérie Pham-Trong, Nicolas Szafran, Luc Biard

Publication date 19 June 2001

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1016617010088

zbMATH Keywords

Bézier curvesBézier surfacescontrol netconvergencegeodesicnumerical examplesparametric surfacepseudo-geodesic meshesshortest path

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Review text

The authors introduce a different way of dealing with the problem of finding the shortest path or a geodesic between two points on a three-dimensional parametric surface. They present two numerical methods to approximate the shortest path. 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, they consider Bézier surfaces and their control net. The numerical impletation 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-geodesic, are then applied to the creation of pseudo-geodesic meshes. Some experimental results are also given.

Recommendations

• A survey of geodesic paths on 3D surfaces
• scientific article; zbMATH DE number 833613
• Geodesic computation on implicit surfaces
• Mathematics of Surfaces XI
• Constructing PDE-based surfaces bounded by geodesics or lines of curvature
• Geodesic curve computations on surfaces
• scientific article; zbMATH DE number 7240932
• Geodesic spanners on polyhedral surfaces

Cited in

(9)

• Computing approximately shortest descending paths on convex terrains via multiple shooting
• Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
• Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
• Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
• Multiple shooting approach for computing approximately shortest paths on convex polytopes
• scientific article; zbMATH DE number 7151640 (Why is no real title available?)
• Straightest Paths on Meshes by Cutting Planes
• Convergence of geodesics on triangulations
• Geodesic-like curves on parametric surfaces

This page was built for publication: Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5934381)