On Shortest Paths in Polyhedral Spaces

Cited In (80)

Algorithms for approximate shortest path queries on weighted polyhedral surfaces
Continuous alternation: the complexity of pursuit in continuous domains
Shortest paths for line segments
Routing among convex polygonal obstacles in the plane
Storing the subdivision of a polyhedral surface
A survey of geodesic paths on 3D surfaces
Routing in polygonal domains
Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
A survey of motion planning and related geometric algorithms
An optimal-time algorithm for shortest paths on realistic polyhedra
Shortest paths, single origin‐destination network design, and associated polyhedra
Visibility graphs and obstacle-avoiding shortest paths
Ununfoldable polyhedra with convex faces
Distance and Short Parallel Paths in Augmented Cubes
Computing homotopic shortest paths in the plane
An algorithmic approach to some problems in terrain navigation
Voronoi diagrams with barriers and on polyhedra for minimal path planning
Optimal path planning based on visibility
Cut locus realizations on convex polyhedra
Computing minimum length paths of a given homotopy class
Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
An improved algorithm for the shortest descending path on a convex terrain
A polynomial solution for the Potato-peeling problem
Star-Unfolding Polygons
A Generalization of the Source Unfolding of Convex Polyhedra
\(L_ 1\) shortest paths among polygonal obstacles in the plane
On the shortest paths between two convex polyhedra
On the length of simplex paths: The assignment case
Computing the external geodesic diameter of a simple polygon
A new algorithm for shortest paths among obstacles in the plane
Star unfolding from a geodesic curve
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
Parallel chen-han (PCH) algorithm for discrete geodesics
Near optimal algorithm for the shortest descending path on the surface of a convex terrain
Approximate convex decomposition of polyhedra and its applications
Star unfolding of a polytope with applications
Title not available (Why is that?)
Geodesics on the regular tetrahedron and the cube
Shortest monotone descent path problem in polyhedral terrain
Shortest polygonal paths in space
Towards exact geometric computation
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface
Routing in Polygonal Domains
Star Unfolding of a Polytope with Applications
Continuous blooming of convex polyhedra
Star unfolding convex polyhedra via quasigeodesic loops
Parallel rectilinear shortest paths with rectangular obstacles
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
Nonoverlap of the star unfolding
A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane
An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
The application of \(\psi\)-transform for determining a near-optimal path in the presence of polyhedral obstacles
On finding a shortest isothetic path and its monotonicity inside a digital object
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
Maximal nonrevisiting paths in simple polytopes
Title not available (Why is that?)
Input-sensitive compliant motion in the plane
Shortest Path in a Polygon using Sublinear Space.
Multiple shooting approach for computing approximately shortest paths on convex polytopes
On multiple moving objects
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
Rectilinear shortest paths in the presence of rectangular barriers
Computing approximately shortest descending paths on convex terrains via multiple shooting
Development of curves on polyhedra via conical existence
Counting minimal 18-paths in 3D digital space
Title not available (Why is that?)
Title not available (Why is that?)
Parameter estimation for resin transfer molding.
Some inequalities for tetrahedra
Isometric immersions with rectifiable geodesics
Routing among convex polygonal obstacles in the plane
Overlapping edge unfoldings for Archimedean solids and (anti)prisms
Title not available (Why is that?)
The funnel tree algorithm for finding shortest paths on polyhedral surfaces
Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
Toward unfolding doubly covered \(n\)-stars
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
Extremal Functions for Shortening Sets of Paths
A single-exponential upper bound for finding shortest paths in three dimensions

   Recommendations

SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS 👍 👎
Title not available (Why is that?) 👍 👎
On Shortest Paths Amidst Convex Polyhedra 👍 👎
On the shortest paths between two convex polyhedra 👍 👎
Title not available (Why is that?) 👍 👎

This page was built for publication: On Shortest Paths in Polyhedral Spaces

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