COMPUTING SHORTEST PATHS ON POLYHEDRA: APPLICATIONS IN GEOMETRIC MODELING AND SCIENTIFIC VISUALIZATION

DOI10.1142/S0218195994000112MaRDI QIDQ4312277zbMATH OpenOpenAlexFDO

Authors Karsten Opitz, Helmut Pottmann

Publication date 18 March 1996

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195994000112

zbMATH Keywords

approximating polyhedron

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• Approximate shortest path on a polyhedral surface and its applications
• Computing approximate shortest paths on convex polytopes
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• scientific article; zbMATH DE number 3907791
• The Discrete Geodesic Problem

Cited in

(5)

• Fitting scattered data on sphere-like surfaces using spherical splines
• Equidistant Smoothing of Polyhedra with Arbitrary Topologies
• Approximate shortest path on a polyhedral surface and its applications
• A survey of geodesic paths on 3D surfaces
• Curvature analysis and visualization for functions defined on Euclidean spaces or surfaces

This page was built for publication: COMPUTING SHORTEST PATHS ON POLYHEDRA: APPLICATIONS IN GEOMETRIC MODELING AND SCIENTIFIC VISUALIZATION

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