Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves

DOI10.1080/02331934.2017.1387260zbMath1398.90186OpenAlexW2762232873WikidataQ114100902 ScholiaQ114100902MaRDI QIDQ4639124

No author found.

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

zbMATH Keywords

method of orienting curvesstraightest geodesicsequence of trianglesgeometric shortest path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (6)

Unnamed Item ⋮ 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 ⋮ Unnamed Item ⋮ Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding ⋮ A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set

Uses Software

• JavaView

Cites Work

• Unnamed Item
• Unnamed Item
• Multiple shooting approach for computing approximately shortest paths on convex polytopes
• Efficiently determining a locally exact shortest path on polyhedral surfaces
• Blaschke-type theorem and separation of disjoint closed geodesic convex sets
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• 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
• 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
• 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 constraints¹
• Fast Marching Methods
• 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
• 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 Avoiding Forbidden Subpaths
• Metric spaces, convexity and nonpositive curvature
• Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes

This page was built for publication: Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves