On Shortest Paths in Polyhedral Spaces
From MaRDI portal
Publication:3753528
DOI10.1137/0215014zbMath0612.68090OpenAlexW2081777693MaRDI QIDQ3753528
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215014
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Polytopes and polyhedra (52Bxx)
Related Items
A polynomial solution for the Potato-peeling problem ⋮ Computing minimum length paths of a given homotopy class ⋮ Star-Unfolding Polygons ⋮ An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces ⋮ Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric ⋮ Input-sensitive compliant motion in the plane ⋮ Star unfolding of a polytope with applications ⋮ Unnamed Item ⋮ An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ Routing among convex polygonal obstacles in the plane ⋮ A new algorithm for shortest paths among obstacles in the plane ⋮ On multiple moving objects ⋮ Geodesics on the regular tetrahedron and the cube ⋮ Rectilinear shortest paths in the presence of rectangular barriers ⋮ An algorithmic approach to some problems in terrain navigation ⋮ Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon ⋮ Routing in polygonal domains ⋮ A survey of motion planning and related geometric algorithms ⋮ Shortest monotone descent path problem in polyhedral terrain ⋮ Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) ⋮ Development of curves on polyhedra via conical existence ⋮ A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane ⋮ Overlapping edge unfoldings for Archimedean solids and (anti)prisms ⋮ Cut locus realizations on convex polyhedra ⋮ Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves ⋮ Optimal path planning based on visibility ⋮ Toward unfolding doubly covered \(n\)-stars ⋮ An improved algorithm for the shortest descending path on a convex terrain ⋮ Near optimal algorithm for the shortest descending path on the surface of a convex terrain ⋮ Computing approximately shortest descending paths on convex terrains via multiple shooting ⋮ A survey of geodesic paths on 3D surfaces ⋮ Visibility graphs and obstacle-avoiding shortest paths ⋮ Continuous blooming of convex polyhedra ⋮ A Generalization of the Source Unfolding of Convex Polyhedra ⋮ \(L_ 1\) shortest paths among polygonal obstacles in the plane ⋮ On finding a shortest isothetic path and its monotonicity inside a digital object ⋮ Parallel rectilinear shortest paths with rectangular obstacles ⋮ Towards exact geometric computation ⋮ Multiple shooting approach for computing approximately shortest paths on convex polytopes ⋮ The application of \(\psi\)-transform for determining a near-optimal path in the presence of polyhedral obstacles ⋮ Nonoverlap of the star unfolding ⋮ Continuous alternation: the complexity of pursuit in continuous domains ⋮ An optimal-time algorithm for shortest paths on a convex polytope in three dimensions ⋮ Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings ⋮ Parallel chen-han (PCH) algorithm for discrete geodesics ⋮ Star unfolding convex polyhedra via quasigeodesic loops ⋮ Parameter estimation for resin transfer molding ⋮ Computing the external geodesic diameter of a simple polygon ⋮ Star unfolding from a geodesic curve ⋮ Approximate convex decomposition of polyhedra and its applications ⋮ Some inequalities for tetrahedra ⋮ Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface ⋮ Shortest polygonal paths in space ⋮ Storing the subdivision of a polyhedral surface ⋮ Voronoi diagrams with barriers and on polyhedra for minimal path planning ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane ⋮ Routing in Polygonal Domains ⋮ Ununfoldable polyhedra with convex faces
