Pages that link to "Item:Q4639124"

The following pages link to Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves (Q4639124):

Displaying 8 items.

• A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set (Q2242054) (← links)
• A fast and efficient algorithm for determining the connected orthogonal convex hulls (Q2671859) (← links)
• Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves (Q2694526) (← links)
• (Q3391377) (← links)
• Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding (Q4631913) (← links)
• (Q5208219) (← links)
• \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations (Q6551197) (← links)
• The funnel tree algorithm for finding shortest paths on polyhedral surfaces (Q6655495) (← links)