The Clarkson–Shor Technique Revisited and Extended
From MaRDI portal
Publication:4802167
DOI10.1017/S0963548302005527zbMath1031.60011MaRDI QIDQ4802167
Publication date: 20 February 2004
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
arrangements; configurations; Clarkson-Shor technique; conflict relationships in configurations; probabilistic geometry
60D05: Geometric probability and stochastic geometry
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52C45: Combinatorial complexity of geometric structures
Related Items
Many Touchings Force Many Crossings, The higher-order Voronoi diagram of line segments, From proximity to utility: a Voronoi partition of Pareto optima, A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters, Cuttings for disks and axis-aligned rectangles in three-space, Higher-order Voronoi diagrams on triangulated surfaces, Minimizing the diameter of a spanning tree for imprecise points, On grids in topological graphs, Many touchings force many crossings, Crossing patterns of semi-algebraic sets