The number of small semispaces of a finite set of points in the plane
From MaRDI portal
Publication:1070228
DOI10.1016/0097-3165(86)90122-6zbMath0584.05003OpenAlexW2004358658WikidataQ29036422 ScholiaQ29036422MaRDI QIDQ1070228
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(86)90122-6
Related Items
On the expected number of \(k\)-sets, On `\(k\)-sets' in the plane, More on k-sets of finite sets in the plane, On the arrangement of stochastic lines in \(\mathbb{R}^2\), The number of extreme pairs of finite point-sets in Euclidean spaces, PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS, On the number of hyperedges in the hypergraph of lines and pseudo-discs, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, The complexity of point configurations, Points and triangles in the plane and halving planes in space, On \(k\)-sets in arrangements of curves and surfaces, An upper bound on the number of planar \(K\)-sets, Suballowable sequences and geometric permutations, On the average number of \(k\)-sets, CENTROID TRIANGULATIONS FROM k-SETS, New algorithms and bounds for halving pseudolines, Entering and leaving \(j\)-facets, On circles enclosing many points, Applications of random sampling in computational geometry. II, Arrangements of oriented hyperplanes, On levels in arrangements and Voronoi diagrams, The \(k\)-nearest-neighbor Voronoi diagram revisited, \(k\)-sets and random hulls, On the complexity of higher order abstract Voronoi diagrams, The maximum-level vertex in an arrangement of lines
Cites Work
