On the expected number of \(k\)-sets
From MaRDI portal
Publication:1327450
DOI10.1007/BF02574008zbMath0802.52003OpenAlexW2008646062MaRDI QIDQ1327450
Publication date: 12 December 1994
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131301
Geometric probability and stochastic geometry (60D05) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Random convex sets and integral geometry (aspects of convex geometry) (52A22)
Related Items (4)
On the expected number of \(k\)-sets ⋮ Algorithms for ham-sandwich cuts ⋮ A survey of mass partitions ⋮ Improved bounds for the expected number of \(k\)-sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intrinsic volumes and f-vectors of random polytopes
- On the number of k-subsets of a set of n points in the plane
- The number of small semispaces of a finite set of points in the plane
- More on k-sets of finite sets in the plane
- On the shape of the convex hull of random points
- Points and triangles in the plane and halving planes in space
- An upper bound on the number of planar \(K\)-sets
- The colored Tverberg's problem and complexes of injective functions
- Geometric algorithms and combinatorial optimization
- On the expected number of \(k\)-sets
- Algorithms for ham-sandwich cuts
- On the number of line separations of a finite set in the plane
- On the number of halving planes
- Convex bodies, economic cap coverings, random polytopes
- The convex floating body.
- Isotropic random simplices
- [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]
This page was built for publication: On the expected number of \(k\)-sets