SELECTING HEAVILY COVERED POINTS

Citation
B. Chazelle et al., SELECTING HEAVILY COVERED POINTS, SIAM journal on computing, 23(6), 1994, pp. 1138-1151
Citations number
18
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods",Mathematics
Journal title
ISSN journal
00975397
Volume
23
Issue
6
Year of publication
1994
Pages
1138 - 1151
Database
ISI
SICI code
0097-5397(1994)23:6<1138:SHCP>2.0.ZU;2-M
Abstract
A collection of geometric selection lemmas is proved, such as the foll owing: For any set P of n points in three-dimensional space and any se t S of m spheres, where each sphere passes through a distinct paint pa ir in P, there exists a point x, not necessarily in P, that is enclose d by Omega(m(2)/(n(2) log(6) n(2)/m)) of the spheres in S. Similar res ults apply in arbitrary fixed dimensions, and for geometric bodies oth er than spheres. The results have applications in reducing the size of geometric structures. such as three-dimensional Delaunay triangulatio ns and Gabriel graphs, by adding extra points to their defining sets.