Approximate shortest path on a polyhedral surface and its applications

DOI10.1016/S0010-4485(01)00097-5zbMATH Open1206.65160MaRDI QIDQ628041FDOQ628041

Authors: Takashi Kanai, Hiromasa Suzuki 

Publication date: 4 March 2011

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Recommendations

• Computing approximate shortest paths on convex polytopes
• Publication:4886077
• COMPUTING SHORTEST PATHS ON POLYHEDRA: APPLICATIONS IN GEOMETRIC MODELING AND SCIENTIFIC VISUALIZATION
• Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
• Approximating shortest paths on a nonconvex polyhedron

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35)

Cited In (10)

• Discrete Lagrangian algorithm for finding geodesics on triangular meshes
• A survey of geodesic paths on 3D surfaces
• A geometric method for computation of geodesic on parametric surfaces
• Approximating shortest paths on a nonconvex polyhedron
• Approximate geodesic calculation based on an ant colony iterative algorithm
• Efficiently approximating polygonal paths in three and higher dimensions
• COMPUTING SHORTEST PATHS ON POLYHEDRA: APPLICATIONS IN GEOMETRIC MODELING AND SCIENTIFIC VISUALIZATION
• Shortest paths on polyhedral surfaces and terrains
• Efficiently determining a locally exact shortest path on polyhedral surfaces
• Determining approximate shortest paths on weighted polyhedral surfaces

This page was built for publication: Approximate shortest path on a polyhedral surface and its applications

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