scientific article; zbMATH DE number 7151640
From MaRDI portal
Publication:5208219
Recommendations
- Shortest paths for line segments
- Shortest paths in Euclidean graphs
- Approximate Euclidean Shortest Paths in 3-Space
- Rectilinear paths with minimum segment lengths
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Euclidean shortest path in the presence of obstacles
- Euclidean shortest paths in the presence of rectilinear barriers
- Approximate Euclidean shortest paths amid convex obstacles
- scientific article; zbMATH DE number 7650244
- A new algorithm for Euclidean shortest paths in the plane
Cites work
- A survey of geodesic paths on 3D surfaces
- Approximate shortest descending paths
- Approximating shortest paths on a nonconvex polyhedron
- Approximation algorithms for shortest descending paths in terrains
- Computing approximate shortest paths on convex polytopes
- Determining approximate shortest paths on weighted polyhedral surfaces
- Direct multiple shooting method for solving approximate shortest path problems
- Efficiently determining a locally exact shortest path on polyhedral surfaces
- Fast Marching Methods
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- scientific article; zbMATH DE number 3907791 (Why is no real title available?)
- scientific article; zbMATH DE number 1305036 (Why is no real title available?)
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- scientific article; zbMATH DE number 6255232 (Why is no real title available?)
- Metric spaces, convexity and nonpositive curvature
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- On Shortest Paths in Polyhedral Spaces
- Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes
- Shortest descending paths: towards an exact algorithm
- Shortest Gently Descending Paths
- Shortest path problems on a polyhedral surface
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Shortest paths on polyhedral surfaces and terrains
- The weighted region problem
- Touring a sequence of disjoint polygons: complexity and extension
- Touring a sequence of polygons
Cited in
(4)- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- scientific article; zbMATH DE number 1305420 (Why is no real title available?)
- scientific article; zbMATH DE number 7685241 (Why is no real title available?)
- Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208219)