Distributions of points in the unit square and large \(k\)-gons

DOI10.1016/j.ejc.2007.11.021zbMath1139.68053MaRDI QIDQ2427543

Hanno Lefmann

Publication date: 13 May 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.11.021

zbMATH Keywords

Heilbronn's triangle problem

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

05C65: Hypergraphs

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Generalizations of Heilbronn's triangle problem

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal uncrowded hypergraphs
• Developments in Heilbronn's triangle problem
• The on-line Heilbronn's triangle problem
• On Heilbronn's problem in higher dimension
• 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
• A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions
• An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
• On a Problem of Heilbronn†
• On a Problem of Heilbronn, II
• On a Problem of Heilbronn, III
• Algorithms and Computation
• On a Problem of Heilbronn