Constructing a minimum path on a polyhedral surface in R^3

zbMATH Open1289.68190MaRDI QIDQ2850299FDOQ2850299

Authors: V. M. Tereshchenko 

Publication date: 26 September 2013

Published in: Visnyk. Seriya: Fizyko-Matematychni Nauky. Kyïvs'kyĭ Universytet Imeni Tarasa Shevchenka (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3907791
• On Shortest Paths in Polyhedral Spaces
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Efficient computation of geodesic shortest paths
• Computing approximate shortest paths on convex polytopes

zbMATH Keywords

filteringpolytopeshortest pathpriority queue

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Shortest path on a non-convex polyhedron
• Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves

This page was built for publication: Constructing a minimum path on a polyhedral surface in \(\mathbb R^3\)

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