On Shortest Paths in Polyhedral Spaces
From MaRDI portal
Publication:3753528
Recommendations
Cited in
(only showing first 100 items - show all)- scientific article; zbMATH DE number 3907791 (Why is no real title available?)
- The Number of Shortest Paths on the Surface of a Polyhedron
- A polynomial solution for the Potato-peeling problem
- scientific article; zbMATH DE number 140474 (Why is no real title available?)
- Nonoverlap of the star unfolding
- Distance and Short Parallel Paths in Augmented Cubes
- Shortest path problems on a polyhedral surface
- Shortest paths, single origin‐destination network design, and associated polyhedra
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Computing the external geodesic diameter of a simple polygon
- Computing minimum length paths of a given homotopy class
- Cut locus realizations on convex polyhedra
- A new algorithm for shortest paths among obstacles in the plane
- Continuous blooming of convex polyhedra
- Parallel Chen-Han (PCH) algorithm for discrete geodesics
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- On multiple moving objects
- Star-unfolding polygons
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Shortest paths in simply connected regions in \({\mathbb{R}}^ 2\)
- Shortest paths on realistic polyhedra
- scientific article; zbMATH DE number 4112412 (Why is no real title available?)
- The application of \(\psi\)-transform for determining a near-optimal path in the presence of polyhedral obstacles
- Input-sensitive compliant motion in the plane
- Shortest polygonal paths in space
- Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- Computing homotopic shortest paths in the plane
- Approximate convex decomposition of polyhedra and its applications
- Parallel rectilinear shortest paths with rectangular obstacles
- An algorithmic approach to some problems in terrain navigation
- A survey of motion planning and related geometric algorithms
- Star unfolding convex polyhedra via quasigeodesic loops
- Continuous alternation: the complexity of pursuit in continuous domains
- On the length of simplex paths: The assignment case
- Shortest paths for line segments
- Storing the subdivision of a polyhedral surface
- Routing among convex polygonal obstacles in the plane
- Star unfolding of a polytope with applications
- The Discrete Geodesic Problem
- Shortest Path in a Polygon using Sublinear Space.
- New results on shortest paths in three dimensions
- Visibility graphs and obstacle-avoiding shortest paths
- Approximate shortest paths in simple polyhedra
- Star unfolding from a geodesic curve
- A generalization of the source unfolding of convex polyhedra
- Ununfoldable polyhedra with convex faces
- A survey of geodesic paths on 3D surfaces
- Rectilinear shortest paths in the presence of rectangular barriers
- Star Unfolding of a Polytope with Applications
- On Shortest Paths Amidst Convex Polyhedra
- Towards exact geometric computation
- Unobstructed shortest paths in polyhedral environments
- An algorithm for shortest-path motion in three dimensions
- Shortest Path Problems on a Polyhedral Surface
- Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface
- 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
- Geodesics on the regular tetrahedron and the cube
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Development of curves on polyhedra via conical existence
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Shortest monotone descent path problem in polyhedral terrain
- Near optimal algorithm for the shortest descending path on the surface of a convex terrain
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
- scientific article; zbMATH DE number 4064475 (Why is no real title available?)
- Maximal nonrevisiting paths in simple polytopes
- An optimal-time algorithm for shortest paths on realistic polyhedra
- On the shortest paths between two convex polyhedra
- Routing among convex polygonal obstacles in the plane
- An exact method for finding shortest routes on a sphere, avoiding obstacles
- scientific article; zbMATH DE number 123833 (Why is no real title available?)
- Flying over a polyhedral terrain
- Some inequalities for tetrahedra
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- Parameter estimation for resin transfer molding.
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- The funnel tree algorithm for finding shortest paths on polyhedral surfaces
- 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
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- Overlapping edge unfoldings for Archimedean solids and (anti)prisms
- An improved algorithm for the shortest descending path on a convex terrain
- Computing approximately shortest descending paths on convex terrains via multiple shooting
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- scientific article; zbMATH DE number 5287652 (Why is no real title available?)
- Routing in polygonal domains
- Constructing a minimum path on a polyhedral surface in \(\mathbb R^3\)
- Shortest paths on cubes
- Routing in polygonal domains
- Optimal path planning based on visibility
- Isometric immersions with rectifiable geodesics
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- Toward unfolding doubly covered \(n\)-stars
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles
- Counting minimal 18-paths in 3D digital space
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)
