Pages that link to "Item:Q1089803"
From MaRDI portal
The following pages link to \(\epsilon\)-nets and simplex range queries (Q1089803):
Displaying 50 items.
- Efficient searching with linear constraints (Q1591152) (← links)
- A crossing lemma for Jordan curves (Q1647400) (← links)
- Coverings: variations on a result of Rogers and on the epsilon-net theorem of Haussler and Welzl (Q1690259) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← links)
- On the VC-dimension of unique round-trip shortest path systems (Q1730015) (← links)
- Approximating a convex body by a polytope using the epsilon-net theorem (Q1731464) (← links)
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os (Q1741853) (← links)
- Domination in tournaments (Q1745734) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- New applications of random sampling in computational geometry (Q1820582) (← links)
- A general lower bound on the number of examples needed for learning (Q1823011) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- A randomized algorithm for fixed-dimensional linear programming (Q1823854) (← links)
- The Vapnik-Chervonenkis dimension of a random graph (Q1842142) (← links)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- Transversal numbers for hypergraphs arising in geometry (Q1865252) (← links)
- Tight upper bounds for the discrepancy of half-spaces (Q1892434) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- Lines in space: Combinatorics and algorithms (Q1913699) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- Simplex range reporting on a pointer machine (Q1917035) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Independence number and the complexity of families of sets (Q1918552) (← links)
- Quasi-Monte-Carlo methods and the dispersion of point sequences (Q1921094) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- Trimming of graphs, with application to point labeling (Q1959389) (← links)
- On separating points by lines (Q1985301) (← links)
- Radon numbers and the fractional Helly theorem (Q2022784) (← links)
- Active-learning a convex body in low dimensions (Q2032355) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- A new lower bound on Hadwiger-Debrunner numbers in the plane (Q2055287) (← links)
- Bounded \(VC\)-dimension implies the Schur-Erdős conjecture (Q2064760) (← links)
- Small candidate set for translational pattern search (Q2088592) (← links)
- Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
- Dot products in \(\mathbb{F}_q^3\) and the Vapnik-Chervonenkis dimension (Q2092325) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes (Q2121466) (← links)
- Optimal approximations made easy (Q2122796) (← links)
- Around the Danzer problem and the construction of dense forests (Q2154802) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem (Q2189732) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
