Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding

DOI10.1080/01630563.2019.1566927zbMath1423.68533OpenAlexW2914361447WikidataQ128411218 ScholiaQ128411218MaRDI QIDQ4631913

No author found.

Publication date: 23 April 2019

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2019.1566927

zbMATH Keywords

polyhedral surfacestraightest geodesicfunnel algorithmgeometric shortest path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Multiple shooting approach for computing approximately shortest paths on convex polytopes
• Efficiently determining a locally exact shortest path on polyhedral surfaces
• 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
• 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
• Metric spaces, convexity and nonpositive curvature
• Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding