The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane

DOI10.1137/07068299XzbMath1189.52017OpenAlexW2072637582MaRDI QIDQ3629478

Rom Pinchasi

Publication date: 27 May 2009

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

Full work available at URL: https://doi.org/10.1137/07068299x

zbMATH Keywords

Euler's formulatrianglesdistinct areas

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (7)

Erdős type problems in modules over cyclic rings ⋮ Areas of triangles and Beck's theorem in planes over finite fields ⋮ Dense lineability and spaceability in certain subsets of ℓ∞$\ell _{\infty }$ ⋮ Distinct distances on curves via rigidity ⋮ Incidence Bounds for Block Designs ⋮ Extremal problems on triangle areas in two and three dimensions ⋮ Distinct Volume Subsets

This page was built for publication: The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane