scientific article; zbMATH DE number 727953

MaRDI QIDQ4324662zbMATH OpenFDO

Authors A. Amir, Ron Kimmel, Alfred M. Bruckstein

Publication date 5 March 1995

zbMATH Keywords

accuracyalgorithmcomplexityiterative schememinimal geodesicsminimal length pathsshortest paths on surfacesthree-dimensional surface

Mathematics Subject Classification ID

Geodesics in global differential geometry (53C22) Algorithms for approximation of functions (65D15) Computer-aided design (modeling of curves and surfaces) (65D17) Numerical mathematical programming methods (65K05)

Recommendations

• scientific article; zbMATH DE number 3907791
• Constructing a minimum path on a polyhedral surface in R^3
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Efficient computation of geodesic shortest paths
• The Discrete Geodesic Problem

Cited in

(15)

• Shortest descending paths through given faces
• Discrete Lagrangian algorithm for finding geodesics on triangular meshes
• Constructing local controlled developable H-Bézier surfaces by interpolating characteristic curves
• A generalization of surface family with common line of curvature
• Solving the shortest path problem on curved surfaces based on the simulated annealing algorithm
• An algorithm for computing the number of the minimal paths in digital images
• Computing geodesic paths on manifolds
• Design and \(G^{1}\) connection of developable surfaces through Bézier geodesics
• scientific article; zbMATH DE number 2044044 (Why is no real title available?)
• Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
• Shortest paths on polyhedral surfaces and terrains
• Finding Shortest Triangular Path in a Digital Object
• Shortest route on height map using gray-level distance transforms.
• Convergence of geodesics on triangulations
• A survey of geodesic paths on 3D surfaces

This page was built for publication:

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