SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS

DOI10.1142/S0218195996000095zbMath0854.68104OpenAlexW2159549579MaRDI QIDQ4889502

Jindong Chen, Yijie Han

Publication date: 13 January 1997

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

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

zbMATH Keywords

shortest pathcomputational robotics

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (34)

SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM ⋮ Star unfolding of a polytope with applications ⋮ Unnamed Item ⋮ An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ Shortest Path Problems on a Polyhedral Surface ⋮ Curve matching, time warping, and light fields: New algorithms for computing similarity between curves ⋮ Navigating Weighted Regions with Scattered Skinny Tetrahedra ⋮ Fast geodesics computation with the phase flow method ⋮ Shortest monotone descent path problem in polyhedral terrain ⋮ Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ Approximating geodesic distances on 2-manifolds in image \(\mathbb R^3\) ⋮ A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane ⋮ Shortest Journeys in Directed Temporal Graphs ⋮ Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves ⋮ Shortest paths and convex hulls in 2D complexes with non-positive curvature ⋮ Near optimal algorithm for the shortest descending path on the surface of a convex terrain ⋮ De Casteljau's algorithm on manifolds ⋮ Geodesics on point clouds ⋮ A survey of geodesic paths on 3D surfaces ⋮ The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains ⋮ Shortest path problems on a polyhedral surface ⋮ Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding ⋮ On realistic terrains ⋮ Splitting (complicated) surfaces is hard ⋮ Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves ⋮ Random field simulation over curved surfaces: applications to computational structural mechanics ⋮ Multiple shooting approach for computing approximately shortest paths on convex polytopes ⋮ An optimal-time algorithm for shortest paths on a convex polytope in three dimensions ⋮ Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings ⋮ Approximation algorithms for shortest descending paths in terrains ⋮ Parameter estimation for resin transfer molding ⋮ Computing generalized higher-order Voronoi diagrams on triangulated surfaces ⋮ Tracing compressed curves in triangulated surfaces ⋮ Shortest descending paths through given faces

This page was built for publication: SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS