Point sets with many \(k\)-sets
From MaRDI portal
Publication:5946377
DOI10.1007/s004540010022zbMath0988.52028OpenAlexW2021751455WikidataQ29399978 ScholiaQ29399978MaRDI QIDQ5946377
Publication date: 10 July 2002
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004540010022
Related Items (28)
On the arrangement of stochastic lines in \(\mathbb{R}^2\) ⋮ On the union complexity of families of axis-parallel rectangles with a low packing number ⋮ Median trajectories ⋮ Information Spreading by Mobile Particles on a Line ⋮ On some monotone path problems in line arrangements ⋮ A survey of mass partitions ⋮ Kinetic and dynamic data structures for convex hulls and upper envelopes ⋮ Long non-crossing configurations in the plane ⋮ Improved bounds for the expected number of \(k\)-sets ⋮ Minimizing the error of linear separators on linearly inseparable data ⋮ Dense point sets with many halving lines ⋮ On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) ⋮ On levels in arrangements of surfaces in three dimensions ⋮ The projection median of a set of points in \({\mathbb{R}}^{d}\) ⋮ Efficient algorithms for maximum regression depth ⋮ A stronger lower bound on parametric minimum spanning trees ⋮ CENTROID TRIANGULATIONS FROM k-SETS ⋮ On the complexity of the \(k\)-level in arrangements of pseudoplanes ⋮ Separation by convex pseudo-circles ⋮ A combinatorial version of Sylvester's four-point problem ⋮ An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points ⋮ On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs ⋮ An Improved Bound for k-Sets in Four Dimensions ⋮ On the conjectured upper bounds for entries of mutation count matrices ⋮ Optimal Algorithms for Geometric Centers and Depth ⋮ On the number of corner cuts ⋮ Monotone paths in line arrangements ⋮ Algebraic \(k\)-sets and generally neighborly embeddings
This page was built for publication: Point sets with many \(k\)-sets
