Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
From MaRDI portal
(Redirected from Publication:4639124)
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
- An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets
- Computing approximate shortest paths on convex polytopes
- Efficiently determining a locally exact shortest path on polyhedral surfaces
- Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner
- Euclidean shortest paths in the presence of rectilinear barriers
- Euclidean shortest paths. Exact or approximate algorithms.
- Fast Marching Methods
- scientific article; zbMATH DE number 1305036 (Why is no real title available?)
- scientific article; zbMATH DE number 1461897 (Why is no real title available?)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Method of orienting curves for determining the convex hull of a finite set of points in the plane
- Method of orienting curves for solving optimal control problems with state constraints1
- Metric spaces, convexity and nonpositive curvature
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Orienting method for obstacle problems
- Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes
- Shortest Paths Avoiding Forbidden Subpaths
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- Solving a class of optimal control problems which are linear in the control variable by the method of orienting curves
- Solving a class of regular optimal control problems with state constraints by the method of orienting curves
- Some remarks on the method of orienting curves∗
- The Discrete Geodesic Problem
- The method of orienting curves and its application to manipulator trajectory planning
- Zur lösung einer regulären aufgabenklasse der optimalen steuerung im groβen mittels orientierungskurven
- Zur Lösung eines zermelosehen nayigationsproblems
Cited in
(10)- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- scientific article; zbMATH DE number 7499212 (Why is no real title available?)
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- Finding Shortest Triangular Path and its Family inside a Digital Object
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- Finding Shortest Triangular Path in a Digital Object
- \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations
- The funnel tree algorithm for finding shortest paths on polyhedral surfaces
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)
