Efficiently determining a locally exact shortest path on polyhedral surfaces

DOI10.1016/J.CAD.2007.08.001zbMath1206.65120OpenAlexW2114121462MaRDI QIDQ628181

Shi-Qing Xin, Guo-Jin Wang

Publication date: 4 March 2011

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

Full work available at URL: https://doi.org/10.1016/j.cad.2007.08.001

zbMATH Keywords

shortest pathscomputational geometryfast marching methoddiscrete geodesics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (8)

Unnamed Item ⋮ Computing the Riemannian center of mass on meshes ⋮ Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves ⋮ Computing approximately shortest descending paths on convex terrains via multiple shooting ⋮ A survey of geodesic paths on 3D surfaces ⋮ Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding ⋮ Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves ⋮ Multiple shooting approach for computing approximately shortest paths on convex polytopes

This page was built for publication: Efficiently determining a locally exact shortest path on polyhedral surfaces