Selecting Heavily Covered Points

DOI10.1137/S0097539790179919zbMath0813.68157OpenAlexW2078474736MaRDI QIDQ4327414

Raimund Seidel, Leonidas J. Guibas, Micha Sharir, Bernard Chazelle, J. E. Hershberger, Herbert Edelsbrunner

Publication date: 6 April 1995

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539790179919

zbMATH Keywords

Delaunay triangulationsGabriel graphsgeometric selection lemmas

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Real and complex geometry (51M99) Designs and configurations (05B99) General convexity (52A99)

Related Items

Improved bounds on weak \(\varepsilon\)-nets for convex sets, Points and triangles in the plane and halving planes in space, Upper bounds for stabbing simplices by a line, Hitting and Piercing Rectangles Induced by a Point Set