Slimming down by adding; selecting heavily covered points

Authors:
Bernard Chazelle;Herbert Edelsbrunner;Leonidas J. Guibas;John E. Hershberger;Raimund Seidel;Micha Sharir
Affiliations:
-;-;-;-;-;-
Venue:
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Year:
1990

Citing 0
Cited 3

Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)
Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Improved bounds on weak &egr;-nets for convex sets

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that for any set &Pgr; of n points in three-dimensional space there is a set Q of &Ogr;(n1/2 log3 n) points so that the Delaunay triangulation of &Pgr; ∪ Q has at most &Ogr;(n3/2 log3 n) edges — even though the Delaunay triangulation of &Pgr; may have &OHgr;(n2) edges. The main tool of our construction is the following geometric covering result: For any set &Pgr; of n points in three-dimensional space and any set S of m spheres, where each sphere passes through a distinct point pair in &Pgr;, there exists a point x, not necessarily in &Pgr;, that is enclosed by &OHgr;(m2/n2 log3 n2/m) of the spheres in S.parOur results generalize to arbitrary fixed dimensions, to geometric bodies other than spheres, and to geometric structures other than Delaunay triangulations.