Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
From MaRDI portal
Publication:4639124
DOI10.1080/02331934.2017.1387260zbMATH Open1398.90186OpenAlexW2762232873WikidataQ114100902 ScholiaQ114100902MaRDI QIDQ4639124FDOQ4639124
Authors:
Publication date: 3 May 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2017.1387260
Recommendations
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- scientific article; zbMATH DE number 727953
- On Shortest Paths in Polyhedral Spaces
- scientific article; zbMATH DE number 3907791
Cites Work
- Metric spaces, convexity and nonpositive curvature
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Euclidean shortest paths. Exact or approximate algorithms.
- Euclidean shortest paths in the presence of rectilinear barriers
- Fast Marching Methods
- The Discrete Geodesic Problem
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- The method of orienting curves and its application to manipulator trajectory planning
- Computing approximate shortest paths on convex polytopes
- Title not available (Why is that?)
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes
- Efficiently determining a locally exact shortest path on polyhedral surfaces
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets
- An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
- Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
- Solving a class of optimal control problems which are linear in the control variable by the method of orienting curves
- 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
- Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
- Some remarks on the method of orienting curves∗
- Method of orienting curves for determining the convex hull of a finite set of points in the plane
- Zur Lösung eines zermelosehen nayigationsproblems
- Orienting method for obstacle problems
- Title not available (Why is that?)
- Shortest Paths Avoiding Forbidden Subpaths
Cited In (10)
- Title not available (Why is that?)
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- Title not available (Why is that?)
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
- Finding Shortest Triangular Path and its Family inside a Digital Object
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- The funnel tree algorithm for finding shortest paths on polyhedral surfaces
- Finding Shortest Triangular Path in a Digital Object
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations
Uses Software
This page was built for publication: Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639124)
