Efficient exact enumeration of single-source geodesics on a non-convex polyhedron

DOI10.1142/S0218195923500048MaRDI QIDQ6552515zbMATH OpenFDO

Authors Kazuma Tateiri

Publication date 10 June 2024

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

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

zbMATH Keywords

discrete geodesicsenumerationgeodesicslocally-shortest pathspolyhedral geodesics

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The Discrete Geodesic Problem
• Efficient computation of geodesic shortest paths
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Approximating shortest paths on a nonconvex polyhedron
• Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions

Cites work

• A survey of geodesic paths on 3D surfaces
• Efficiently determining a locally exact shortest path on polyhedral surfaces
• The Discrete Geodesic Problem

This page was built for publication: Efficient exact enumeration of single-source geodesics on a non-convex polyhedron

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