Pages that link to "Item:Q1151049"
From MaRDI portal
The following pages link to How to reduce the average complexity of convex hull finding algorithms (Q1151049):
Displaying 10 items.
- Randomized quickhull (Q675302) (← links)
- On the oscillation of the expected number of extreme points of a random set (Q756837) (← links)
- Random convex hulls and extreme value statistics (Q967627) (← links)
- A note on linear expected time algorithms for finding convex hulls (Q1142045) (← links)
- On the computer generation of random convex hulls (Q1155367) (← links)
- Moment inequalities for random variables in computational geometry (Q1172863) (← links)
- Convex hulls of samples from spherically symmetric distributions (Q1175782) (← links)
- Maximal and minimal balls (Q1314525) (← links)
- Random convex hulls in a product of balls (Q1826119) (← links)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
