--- res: bibo_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.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Bernard foaf_name: Chazelle, Bernard foaf_surname: Chazelle - foaf_Person: foaf_givenName: Herbert foaf_name: Edelsbrunner, Herbert foaf_surname: Edelsbrunner foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-9823-6833 - foaf_Person: foaf_givenName: Leonidas foaf_name: Guibas, Leonidas foaf_surname: Guibas - foaf_Person: foaf_givenName: John foaf_name: Hershberger, John foaf_surname: Hershberger - foaf_Person: foaf_givenName: Raimund foaf_name: Seidel, Raimund foaf_surname: Seidel - foaf_Person: foaf_givenName: Micha foaf_name: Sharir, Micha foaf_surname: Sharir bibo_doi: 10.1145/98524.98551 dct_date: 1990^xs_gYear dct_isPartOf: - http://id.crossref.org/issn/978-0-89791-362-1 dct_language: eng dct_publisher: ACM@ dct_title: Slimming down by adding; selecting heavily covered points@ ...