Pages that link to "Item:Q1089803"

The following pages link to \(\epsilon\)-nets and simplex range queries (Q1089803):

Displaying 44 items.

• Sparse Approximation via Generating Point Sets (Q4972677) (← links)
• Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
• On the number of regular vertices of the union of Jordan regions (Q5054868) (← links)
• Intersection queries in sets of disks (Q5056120) (← links)
• Dynamic partition trees (Q5056121) (← links)
• Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← links)
• Algorithms for polytope covering and approximation (Q5060117) (← links)
• A survey of mass partitions (Q5067418) (← links)
• Journey to the Center of the Point Set (Q5088971) (← links)
• (Q5088983) (← links)
• (Q5088989) (← links)
• Extending the centerpoint theorem to multiple points (Q5091045) (← links)
• (Q5091184) (← links)
• (Q5091247) (← links)
• On range searching with semialgebraic sets (Q5096815) (← links)
• On Partial Covering For Geometric Set Systems (Q5115815) (← links)
• An efficient container lemma (Q5144433) (← links)
• Pseudofinite groups and VC-dimension (Q5156474) (← links)
• Incidences in Three Dimensions and Distinct Distances in the Plane (Q5199508) (← links)
• Lower bounds on the complexity of simplex range reporting on a pointer machine (Q5204338) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• Using $$\epsilon $$ -nets for Solving the Classification Problem (Q5274971) (← links)
• (Q5743481) (← links)
• (Q5743501) (← links)
• A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension (Q5743609) (← links)
• Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. (Q5874550) (← links)
• (Q5875512) (← links)
• Subtrajectory clustering: finding set covers for set systems of subcurves (Q5881551) (← links)
• On approximate range counting and depth (Q5902137) (← links)
• Capacitated discrete unit disk cover (Q5918931) (← links)
• Computing coverage kernels under restricted settings (Q5919535) (← links)
• A lower bound for families of Natarajan dimension \(d\) (Q5940311) (← links)
• Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses (Q5943320) (← links)
• A note on stabbing convex bodies with points, lines, and flats (Q6045792) (← links)
• Danzer's problem, effective constructions of dense forests and digital sequences (Q6074969) (← links)
• On the geometric priority set cover problem (Q6103173) (← links)
• Guarding polyominoes under \(k\)-hop visibility (Q6547940) (← links)
• A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)
• The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
• Hitting sets when the shallow cell complexity is small (Q6574945) (← links)
• Approximate equivalence relations (Q6593613) (← links)
• A note on the \(k\)-restriction problem (Q6602326) (← links)
• A new lower bound on Hadwiger-Debrunner numbers in the plane (Q6621229) (← links)
• Twin-width. III: Max independent set, min dominating set, and coloring (Q6631356) (← links)