Point Selections and Weak ε-Nets for Convex Hulls
From MaRDI portal
Publication:4291196
DOI10.1017/S0963548300000225zbMATH Open0797.52004DBLPjournals/cpc/AlonBFK92WikidataQ101133139 ScholiaQ101133139MaRDI QIDQ4291196FDOQ4291196
Authors: Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman 
Publication date: 30 May 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
- Weak \(\varepsilon\)-nets for points on a hypersphere
- Convex Hulls of Point-Sets and Non-uniform Hypergraphs
- scientific article; zbMATH DE number 4178824
- A bound on a convexity measure for point sets
- On triangulations of the convex hull of n points
- scientific article; zbMATH DE number 739012
- On \(k\)-convex point sets
- On convex holes in d-dimensional point sets
- Construction of the convex hull of a finite set of points when the computations are approximate
- scientific article; zbMATH DE number 637384
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Cites Work
- On extremal problems of graphs and generalized graphs
- The number of triangles covering the center of an \(n\)-set
- A generalization of Caratheodory's theorem
- On empty triangles determined by points in the plane
- A Generalization of Radon's Theorem
- Supersaturated graphs and hypergraphs
- Points and triangles in the plane and halving planes in space
- On the number of halving planes
- Partitioning with two lines in the plane
Cited In (57)
- A topological colorful Helly theorem
- Title not available (Why is that?)
- Lower bounds for weak epsilon-nets and stair-convexity
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space
- Helly-type theorems for the diameter
- Improved bounds on the Hadwiger-Debrunner numbers
- Eppstein's bound on intersecting triangles revisited
- An optimal extension of the centerpoint theorem
- Algebraic \(k\)-sets and generally neighborly embeddings
- Dynamic half-space range reporting and its applications
- Small weak epsilon-nets
- Algorithms for ham-sandwich cuts
- Upper bounds for stabbing simplices by a line
- Reprint of: Weak \(\varepsilon\)-nets have basis of size \(O(1/{\epsilon}\log (1/\epsilon))\) in any dimension
- Improved bounds on weak \(\varepsilon\)-nets for convex sets
- Piercing convex sets
- Weak \(\varepsilon\)-nets for points on a hypersphere
- A Tverberg-type result on multicolored simplices
- Radon numbers and the fractional Helly theorem
- Colourful linear programming
- Selection lemmas for various geometric objects
- Hitting simplices with points in \(\mathbb R^{3}\)
- A variant of the Hadwiger-Debrunner \((p,q)\)-problem in the plane
- Helly-type problems
- On weak \(\epsilon\)-nets and the Radon number
- A non-linear lower bound for planar epsilon-nets
- Tverberg’s theorem is 50 years old: A survey
- A note on stabbing convex bodies with points, lines, and flats
- Title not available (Why is that?)
- Counting triangle crossings and halving planes
- New constructions of weak epsilon-nets
- Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
- Radon numbers grow linearly
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem
- A survey of mass partitions
- Stabbing simplices by points and flats
- Bounding Helly numbers via Betti numbers
- An optimal generalization of the colorful Carathéodory theorem
- Bounding the piercing number
- Helly’s theorem: New variations and applications
- One-sided epsilon-approximants
- A new lower bound on Hadwiger-Debrunner numbers in the plane
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- Transversal numbers for hypergraphs arising in geometry
- Quantitative \((p, q)\) theorems in combinatorial geometry
- Further consequences of the colorful Helly hypothesis
- Further consequences of the colorful Helly hypothesis
- Quantitative fractional Helly and \((p,q)\)-theorems
- An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets
- Nerves, minors, and piercing numbers
- Positive-fraction intersection results and variations of weak epsilon-nets
- Brillouin zones of integer lattices and their perturbations
- Some new results on geometric transversals
- A new lower bound on Hadwiger-Debrunner numbers in the plane
- No-dimension Tverberg's theorem and its corollaries in Banach spaces of type \(P\)
- Orientation of convex sets
This page was built for publication: Point Selections and Weak ε-Nets for Convex Hulls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291196)
