Pages that link to "Item:Q1823698"

The following pages link to Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698):

Displaying 50 items.

• Tight lower bounds for halfspace range searching (Q420572) (← links)
• Optimal partition trees (Q420575) (← links)
• Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
• On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
• How hard is half-space range searching? (Q685178) (← links)
• Range searching with efficient hierarchical cuttings (Q685179) (← links)
• Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
• Two proofs for shallow packings (Q728497) (← links)
• Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
• Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
• Storing line segments in partition trees (Q911289) (← links)
• Construction of \(\epsilon\)-nets (Q914376) (← links)
• Partitioning arrangements of lines. II: Applications (Q921915) (← links)
• Tight bounds for connecting sites across barriers (Q958235) (← links)
• Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
• Convex subdivisions with low stabbing numbers (Q1046805) (← links)
• Almost tight bounds for \(\epsilon\)-nets (Q1184160) (← links)
• Reporting points in halfspaces (Q1196295) (← links)
• Applications of a new space-partitioning technique (Q1196362) (← links)
• Intersection queries in sets of disks (Q1196457) (← links)
• Efficient partition trees (Q1199132) (← links)
• Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
• Implicitly representing arrangements of lines or segments (Q1263966) (← links)
• Discrepancy and approximations for bounded VC-dimension (Q1316651) (← links)
• On range searching with semialgebraic sets (Q1329188) (← links)
• Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
• Rectilinear decompositions with low stabbing number (Q1341685) (← links)
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876) (← links)
• The VC-dimension of set systems defined by graphs (Q1364472) (← links)
• Improved upper bounds for approximation by zonotopes (Q1373005) (← links)
• Spanning trees crossing few barriers (Q1422228) (← links)
• Approximate range searching (Q1595401) (← links)
• Tight upper bounds for the discrepancy of half-spaces (Q1892434) (← links)
• Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
• Simplex range reporting on a pointer machine (Q1917035) (← links)
• On separating points by lines (Q1985301) (← links)
• A Sauer-Shelah-Perles lemma for lattices (Q2209889) (← links)
• On \(k\)-convex point sets (Q2248736) (← links)
• Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
• Minimum-link paths revisited (Q2450201) (← links)
• VC-dimension and Erdős-Pósa property (Q2515568) (← links)
• The VC dimension of metric balls under Fréchet and Hausdorff distances (Q2665263) (← links)
• On the Most Likely Voronoi Diagram and Nearest Neighbor Searching (Q2988722) (← links)
• Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures (Q3000523) (← links)
• Spanning trees with low crossing number (Q3358265) (← links)
• Lower Bounds on the Complexity of Polytope Range Searching (Q3471697) (← links)
• Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
• Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
• Fast Diameter Computation within Split Graphs (Q5024674) (← links)
• Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)