The on-line Heilbronn's triangle problem

DOI10.1016/j.disc.2004.03.001zbMath1052.52012OpenAlexW2074271692MaRDI QIDQ1827762

Gill Barequet

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.03.001

zbMATH Keywords

volumeHeilbronn's triangle problemsimplicespacking arguments

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial complexity of geometric structures (52C45)

Related Items (6)

Large triangles in the \(d\)-dimensional unit cube ⋮ Heilbronn's problem of eight points in the square ⋮ Distributions of points in the unit square and large \(k\)-gons ⋮ Distributions of points in \(d\) dimensions and large \(k\) -point simplices ⋮ Point sets in the unit square and large areas of convex hulls of subsets of points ⋮ Generalizations of Heilbronn's triangle problem

Cites Work

• Developments in Heilbronn's triangle problem
• A Lower Bound for Heilbronn's Triangle Problem in d Dimensions
• On Heilbronn's Triangle Problem
• A Lower Bound for Heilbronn'S Problem
• On a Problem of Heilbronn†
• On a Problem of Heilbronn
• Unnamed Item

This page was built for publication: The on-line Heilbronn's triangle problem