Improved bounds for planar \(k\)-sets and related problems
From MaRDI portal
Publication:1387847
DOI10.1007/PL00009354zbMath0899.68107OpenAlexW2149757010WikidataQ29393621 ScholiaQ29393621MaRDI QIDQ1387847
Publication date: 8 June 1998
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009354
Related Items
On the arrangement of stochastic lines in \(\mathbb{R}^2\), Space Crossing Numbers, Computing a minimum-width square or rectangular annulus with outliers, A lower bound on the number of triangulations of planar point sets, Exact algorithms for size constrained 2-clustering in the plane, A stronger lower bound on parametric minimum spanning trees, On the union complexity of families of axis-parallel rectangles with a low packing number, Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem, Median trajectories, Divide and Conquer Method for k-Set Polygons, Information Spreading by Mobile Particles on a Line, A crossing lemma for Jordan curves, On some monotone path problems in line arrangements, A survey of mass partitions, Kinetic and dynamic data structures for convex hulls and upper envelopes, PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS, On halving-edges graphs, Approximating majority depth, Generalized ham-sandwich cuts, Long non-crossing configurations in the plane, Crossings between non-homotopic edges, Improved bounds for the expected number of \(k\)-sets, A crossing lemma for multigraphs, Crossings in grid drawings, Parametric matroid interdiction, Minimizing the error of linear separators on linearly inseparable data, Relative \((p,\varepsilon )\)-approximations in geometry, Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\), Reprint of: Approximating majority depth, Continuous location of dimensional structures., 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, A successful concept for measuring non-planarity of graphs: The crossing number., Sorting weighted distances with applications to objective function evaluations in single facility location problems., Many Touchings Force Many Crossings, On Combinatorial Depth Measures, The projection median of a set of points in \({\mathbb{R}}^{d}\), Bisecting three classes of lines, Efficient algorithms for maximum regression depth, A stronger lower bound on parametric minimum spanning trees, CENTROID TRIANGULATIONS FROM k-SETS, Location of weighted anti-ordered median straight lines with Euclidean distances, The \(k\)-centrum multi-facility location problem, A bipartite strengthening of the crossing Lemma, Entering and leaving \(j\)-facets, Approximation of the yolk by the LP yolk, Perfect matchings with crossings, On the complexity of the \(k\)-level in arrangements of pseudoplanes, Separation by convex pseudo-circles, Finding all pure strategy Nash equilibria in a planar location game, Unnamed Item, Crossing numbers of imbalanced graphs, A Bipartite Strengthening of the Crossing Lemma, 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, Cycle bases of graphs and sampled manifolds, Planar point sets determine many pairwise crossing segments, On circles enclosing many points, Computing a Minimum-Width Square or Rectangular Annulus with Outliers, The projection median of a set of points, Many touchings force many crossings, The Crossing Number of Graphs: Theory and Computation, On the conjectured upper bounds for entries of mutation count matrices, Points surrounding the origin, Efficient searching with linear constraints, Crossings Between Non-homotopic Edges, Optimal Algorithms for Geometric Centers and Depth, A crossing lemma for multigraphs, Monotone paths in line arrangements, The maximum-level vertex in an arrangement of lines, Algebraic \(k\)-sets and generally neighborly embeddings
