Pages that link to "Item:Q1142045"
From MaRDI portal
The following pages link to A note on linear expected time algorithms for finding convex hulls (Q1142045):
Displaying 4 items.
- A note on finding convex hulls via maximal vectors (Q1144946) (← links)
- On the computer generation of random convex hulls (Q1155367) (← links)
- Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)