Generalizations of Heilbronn's triangle problem

DOI10.1016/j.ejc.2009.03.003zbMath1193.52009OpenAlexW2020658846MaRDI QIDQ1039441

Hanno Lefmann

Publication date: 30 November 2009

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

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

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Hypergraphs (05C65) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Inequalities and extremum problems in real or complex geometry (51M16)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large triangles in the \(d\)-dimensional unit cube
• Distributions of points in \(d\) dimensions and large \(k\) -point simplices
• 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
• Distributions of points in the unit square and large \(k\)-gons
• 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
• An Algorithm for Heilbronn's Problem
• 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

This page was built for publication: Generalizations of Heilbronn's triangle problem