Pages that link to "Item:Q3553761"
From MaRDI portal
The following pages link to Method of orienting curves for determining the convex hull of a finite set of points in the plane (Q3553761):
Displaying 12 items.
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set (Q2242054) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- Quicker than Quickhull (Q2354631) (← 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)
- An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves (Q2868910) (← links)
- (Q3391377) (← links)
- Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon (Q3578011) (← 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)
- A convex Hull algorithm for solving a location problem (Q5501876) (← links)
