Pages that link to "Item:Q2868910"

The following pages link to An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves (Q2868910):

Displaying 9 items.

• A parallel algorithm based on convexity for the computing of Delaunay tessellation (Q664607) (← links)
• An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092) (← links)
• QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
• Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves (Q2694526) (← links)
• A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D (Q2808066) (← links)
• (Q3391377) (← links)
• Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding (Q4631913) (← links)
• Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves (Q4639124) (← links)
• An Exact Algorithm for Minimizing a Sum of Euclidean Norms on Rays in 2D and 3D (Q5264005) (← links)