Point sets in the unit square and large areas of convex hulls of subsets of points

DOI10.1007/s10878-008-9168-7zbMath1183.68746OpenAlexW2798263356MaRDI QIDQ1016043

Hanno Lefmann

Publication date: 4 May 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.404.3619

zbMATH Keywords

approximation algorithmhypergraphsHeilbronn's triangle problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Convex sets in (2) dimensions (including convex curves) (52A10) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Extremal uncrowded hypergraphs
• Developments in Heilbronn's triangle problem
• The on-line Heilbronn's triangle problem
• The on-line Heilbronn's triangle problem in \(d\) dimensions
• On Heilbronn's problem in higher dimension
• Turan's theorem for \(k\)-graphs
• A Lower Bound for Heilbronn's Triangle Problem in d Dimensions
• Lower Bounds on the Complexity of Polytope Range Searching
• On Heilbronn's Triangle Problem
• A Lower Bound for Heilbronn'S Problem
• The Algorithmic Aspects of Uncrowded Hypergraphs
• An Algorithm for Heilbronn's Problem
• The average‐case area of Heilbronn‐type triangles*
• On uncrowded hypergraphs
• Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs
• An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
• Distributions of Points and Large Convex Hulls of k Points
• On a Problem of Heilbronn†
• On a Problem of Heilbronn, II
• On a Problem of Heilbronn, III
• On a Problem of Heilbronn

This page was built for publication: Point sets in the unit square and large areas of convex hulls of subsets of points