The Clarkson–Shor Technique Revisited and Extended

DOI10.1017/S0963548302005527zbMath1031.60011OpenAlexW2139225572MaRDI QIDQ4802167

Micha Sharir

Publication date: 20 February 2004

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548302005527

zbMATH Keywords

arrangementsconfigurationsClarkson-Shor techniqueconflict relationships in configurationsprobabilistic geometry

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (10)

Cuttings for disks and axis-aligned rectangles in three-space ⋮ From proximity to utility: a Voronoi partition of Pareto optima ⋮ Minimizing the diameter of a spanning tree for imprecise points ⋮ Many Touchings Force Many Crossings ⋮ On grids in topological graphs ⋮ Higher-order Voronoi diagrams on triangulated surfaces ⋮ A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters ⋮ Many touchings force many crossings ⋮ Crossing patterns of semi-algebraic sets ⋮ The higher-order Voronoi diagram of line segments

This page was built for publication: The Clarkson–Shor Technique Revisited and Extended