Selecting Heavily Covered Points

DOI10.1137/S0097539790179919MaRDI QIDQ4327414zbMATH OpenOpenAlexFDO

Authors Raimund Seidel, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, John Hershberger, Micha Sharir

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

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

Recommendations

• scientific article; zbMATH DE number 2103167
• Selecting and covering colored points
• Selection of efficient points
• Covering Point Patterns
• On Gromov's method of selecting heavily covered points
• Covering points with a polygon
• Path point cover
• Covering a set of points in multidimensional space
• Covering many points with a small-area box

Cited in

(8)

• Points and triangles in the plane and halving planes in space
• Improved bounds on weak \(\varepsilon\)-nets for convex sets
• Upper bounds for stabbing simplices by a line
• Selection lemmas for various geometric objects
• scientific article; zbMATH DE number 2103167 (Why is no real title available?)
• Hitting and Piercing Rectangles Induced by a Point Set
• Improving the first selection lemma in \(\mathbb{R}^3\)
• On Gromov's method of selecting heavily covered points

This page was built for publication: Selecting Heavily Covered Points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327414)