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

DOI10.1137/07068299XMaRDI QIDQ3629478zbMATH OpenOpenAlexFDO

Authors 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

distinct areasEuler's formulatriangles

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)

Recommendations

• Distinct Triangle Areas in a Planar Point Set
• Extremal problems on triangle areas in two and three dimensions
• Some extremal problems in geometry
• Triangles of extremal area or perimeter in a finite planar point set
• An improved bound on the number of unit area triangles

Cited in

(12)

• Extremal problems on triangle areas in two and three dimensions
• Triangles of nearly equal area
• Distinct distances on curves via rigidity
• Erdős type problems in modules over cyclic rings
• Incidence bounds for block designs
• Areas of triangles and Beck's theorem in planes over finite fields
• Distinct volume subsets
• Optimal point sets determining few distinct triangles
• Distinct Triangle Areas in a Planar Point Set
• Dense lineability and spaceability in certain subsets of ℓ∞$\ell _{\infty }$
• Distinct triangle areas in a planar point set over finite fields
• The number of isosceles right triangles determined by n points in convex position in the plane

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629478)