Pages that link to "Item:Q1089803"
From MaRDI portal
The following pages link to \(\epsilon\)-nets and simplex range queries (Q1089803):
Displaying 50 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\) (Q269155) (← links)
- Unsplittable coverings in the plane (Q317324) (← links)
- From proximity to utility: a Voronoi partition of Pareto optima (Q331376) (← links)
- Solving the classification problem using \(\varepsilon\)-nets (Q333577) (← links)
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
- Small strong epsilon nets (Q396471) (← links)
- VC-dimension of perimeter visibility domains (Q402367) (← links)
- Clique versus independent set (Q402465) (← links)
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space (Q407569) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- The class cover problem with boxes (Q419500) (← links)
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- Optimal partition trees (Q420575) (← links)
- Piercing quasi-rectangles-on a problem of Danzer and Rogers (Q439049) (← links)
- On strong centerpoints (Q483053) (← links)
- An algorithm to construct separable \(\epsilon\)-nets of two sets (Q508581) (← links)
- On the Beer index of convexity and its variants (Q512263) (← links)
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
- Lower bounds for weak epsilon-nets and stair-convexity (Q532609) (← links)
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- On the union of cylinders in three dimensions (Q629833) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- Polychromatic coloring for half-planes (Q645968) (← links)
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- \(\varepsilon\)-approximations of \(k\)-label spaces (Q674408) (← links)
- On intersecting a point set with Euclidean balls (Q676066) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- A note on smaller fractional Helly numbers (Q745669) (← links)
- A deterministic view of random sampling and its use in geometry (Q751816) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Dynamic partition trees (Q804289) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- An optimal generalization of the colorful Carathéodory theorem (Q906475) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
