Pages that link to "Item:Q827092"
From MaRDI portal
The following pages link to An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092):
Displaying 5 items.
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set (Q2242054) (← links)
- A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) (Q2279854) (← links)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
- An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves (Q2868910) (← links)
- (Q3391377) (← links)
