Selecting Heavily Covered Points

DOI10.1137/S0097539790179919zbMATH Open0813.68157OpenAlexW2078474736MaRDI QIDQ4327414FDOQ4327414

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

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

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) General convexity (52A99) Designs and configurations (05B99) Real and complex geometry (51M99)

Cited In (8)

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

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)