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):
Displaying 21 items.
- Approximate center points in dense point sets (Q287016) (← links)
- Small strong epsilon nets (Q396471) (← links)
- On strong centerpoints (Q483053) (← links)
- Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions (Q679740) (← links)
- Multidimensional agreement in Byzantine systems (Q901876) (← links)
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
- 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)
- Computational aspects of the colorful Carathéodory theorem (Q1991350) (← links)
- Packing plane spanning trees into a point set (Q2206739) (← links)
- Computing the center region and its variants (Q2272371) (← links)
- Algorithms for bivariate zonoid depth (Q2456661) (← links)
- Extending the centerpoint theorem to multiple points (Q5091045) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Approximating Tverberg points in linear time for any fixed dimension (Q5891192) (← links)
- Intersecting convex sets by rays (Q5896956) (← links)
- Balanced line separators of unit disk graphs (Q5918796) (← links)
- Gathering in the plane of location-aware robots in the presence of spies (Q5918903) (← links)
