Pages that link to "Item:Q1338958"
From MaRDI portal
The following pages link to Computing a centerpoint of a finite planar set of points in linear time (Q1338958):
Displayed 6 items.
- Centerpoints and Tverberg's technique (Q982949) (← links)
- Approximate centerpoints with proofs (Q991175) (← links)
- Small weak epsilon-nets (Q1025302) (← links)
- The complexity of hyperplane depth in the plane (Q1423588) (← links)
- Algorithms for bivariate zonoid depth (Q2456661) (← links)
- Intersecting convex sets by rays (Q5896956) (← links)