Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
DOI10.1007/s10898-022-01244-xOpenAlexW4304806617MaRDI QIDQ2694526
Publication date: 3 April 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01244-x
shortest pathglobal solutionpolytopepath planningexact algorithmpolyhedral surfacestraightest geodesicconvex non-differentiable optimizationplanar unfolding
Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Mathematical programming (90Cxx) Numerical algorithms for specific classes of architectures (65Y10) Computational issues in computer and robotic vision (65D19)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shortest path problems on a polyhedral surface
- Convergence of geodesics on triangulations
- Efficiently determining a locally exact shortest path on polyhedral surfaces
- Shortest polygonal paths in space
- Solving a class of optimal control problems which are linear in the control variable by the method of orienting curves
- Computing approximate shortest paths on convex polytopes
- Orienting method for obstacle problems
- An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves
- The Discrete Geodesic Problem
- Euclidean shortest paths in the presence of rectilinear barriers
- Method of orienting curves for determining the convex hull of a finite set of points in the plane
- On Shortest Paths in Polyhedral Spaces
- Zur Lösung eines zermelosehen nayigationsproblems
- Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
- Method of orienting curves for solving optimal control problems with state constraints1
- Solving a class of regular optimal control problems with state constraints by the method of orienting curves
- The method of orienting curves and its application to manipulator trajectory planning
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
- Some remarks on the method of orienting curves∗
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Shortest paths on polyhedral surfaces and terrains
- Metric spaces, convexity and nonpositive curvature
- Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes
This page was built for publication: Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves