In this paper generalizations of Heilbronn 's triangle problem are considered. By using results on the independence number of linear hypergraphs, for fixed integers k ≥ 3 and any integers n ≥ k a o(n6k-4) time deterministic algorithm is given, which finds distributions of n points in the unit square [0,1]2 such that, simultaneously for j = 3, . . ., k, the areas of the convex hulls determined by any j of these n points are Ω((logn)1/(j-2)/n(j-1)/(j-2)). © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Lefmann, H. (2007). Point sets in the unit square and large areas of convex hulls of subsets of points. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4616 LNCS, pp. 230–241). Springer Verlag. https://doi.org/10.1007/978-3-540-73556-4_26
Mendeley helps you to discover research relevant for your work.