Pages that link to "Item:Q1144946"
From MaRDI portal
The following pages link to A note on finding convex hulls via maximal vectors (Q1144946):
Displaying 15 items.
- Fast algorithms for computing the diameter of a finite planar set (Q1104078) (← links)
- A note on linear expected time algorithms for finding convex hulls (Q1142045) (← links)
- How to reduce the average complexity of convex hull finding algorithms (Q1151049) (← links)
- Moment inequalities for random variables in computational geometry (Q1172863) (← links)
- Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
- On the variance of the number of maxima in random vectors and its applications (Q1296610) (← links)
- Random polytopes in a convex polytope, independence of shape, and concentration of vertices (Q1318141) (← links)
- Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
- On the average number of maximal in a set of vectors (Q1824385) (← links)
- Random convex hulls in a product of balls (Q1826119) (← links)
- Records, the maximal layer, and uniform distributions in monotone sets (Q2365949) (← links)
- Evolutionarily stable strategies of random games, and the vertices of random polygons (Q2476406) (← links)
- Direct dominance of points (Q3802650) (← links)
- On random cartesian trees (Q4286297) (← links)
- Sampling-based approximate skyline calculation on big data (Q5057727) (← links)
