--- res: bibo_abstract: - This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in a tetrahedrization of n points in general position in three dimensions, i.e. such that no four points are coplanar. It also presents an algorithm that in O(nlog n) time constructs a tetrahedrization of a set of n points consisting of at most 3n–11 tetrahedra.@eng bibo_authorlist: - 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: Franco foaf_name: Preparata, Franco foaf_surname: Preparata - foaf_Person: foaf_givenName: Douglas foaf_name: West, Douglas foaf_surname: West bibo_doi: 10.1007/3-540-51084-2_31 bibo_volume: 358 dct_date: 1989^xs_gYear dct_language: eng dct_publisher: Springer@ dct_title: Tetrahedrizing point sets in three dimensions@ ...