@inproceedings{a10e2fad77fe4ae6b28c6c3826507216,
title = "Slimming down by adding; selecting heavily covered points",
abstract = "In this paper we derived combinatorial point selection results for geometric objects defined by pairs of points. In a nutshell, the results say that if many pairs of a set of n points in some fixed dimension each define a geometric object of some type, then there is a point covered by many of these objects. Based on such a result for three-dimensional spheres we show that the combinatorial size of the Delaunay triangulation of a point set in space can be reduced by adding new points. We believe that from a practical point of view this is the most important result of this paper.",
author = "Bernard Chazelle and Herbert Edelsbrunner and Guibas, {Leonidas J.} and Hershberger, {John E.} and Raimund Seidel and Micha Sharir",
year = "1990",
month = jan,
day = "1",
doi = "10.1145/98524.98551",
language = "English (US)",
isbn = "0897913620",
series = "Proc Sixth Annu Symp Comput Geom",
publisher = "Publ by ACM",
pages = "116--127",
booktitle = "Proc Sixth Annu Symp Comput Geom",
note = "Proceedings of the Sixth Annual Symposium on Computational Geometry ; Conference date: 06-06-1990 Through 08-06-1990",
}