Efficiently determining a locally exact shortest path on polyhedral surfaces
DOI10.1016/J.CAD.2007.08.001zbMATH Open1206.65120OpenAlexW2114121462MaRDI QIDQ628181FDOQ628181
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
Recommendations
- Approximate shortest path on a polyhedral surface and its applications
- scientific article; zbMATH DE number 3907791
- Shortest Path Problems on a Polyhedral Surface
- Shortest path problems on a polyhedral surface
- Approximating shortest paths on weighted polyhedral surfaces
- scientific article; zbMATH DE number 1225263
- Shortest paths on polyhedral surfaces and terrains
- Determining approximate shortest paths on weighted polyhedral surfaces
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
- Approximate shortest paths in simple polyhedra
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)
Cited In (13)
- Efficient exact enumeration of single-source geodesics on a non-convex polyhedron
- A survey of geodesic paths on 3D surfaces
- Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding
- Splines on manifolds: a survey
- Title not available (Why is that?)
- Computing the Riemannian center of mass on meshes
- Efficient Computation of the Outer Hull of a Discrete Path
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- The funnel tree algorithm for finding shortest paths on polyhedral surfaces
- Shortest paths on polyhedral surfaces and terrains
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Computing approximately shortest descending paths on convex terrains via multiple shooting
This page was built for publication: Efficiently determining a locally exact shortest path on polyhedral surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628181)
