Point sets in the unit square and large areas of convex hulls of subsets of points
Hanno Lefmann ()
Additional contact information
Hanno Lefmann: TU Chemnitz
Journal of Combinatorial Optimization, 2008, vol. 16, issue 2, No 8, 182-195
Abstract:
Abstract In this paper generalizations of Heilbronn’s triangle problem to convex hulls of j points in the unit square [0,1]2 are considered. By using results on the independence number of linear hypergraphs, for fixed integers k≥3 and any integers n≥k a deterministic o(n 6k−4) time algorithm is given, which finds distributions of n points in [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 Ω((log n)1/(j−2)/n (j−1)/(j−2)).
Keywords: Heilbronn’s triangle problem; Approximation algorithm; Hypergraphs (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10878-008-9168-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:16:y:2008:i:2:d:10.1007_s10878-008-9168-7
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-008-9168-7
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().