How many unit equilateral triangles can be generated by N points in convex position?

DOI10.2307/3647826zbMATH Open1187.52016OpenAlexW2094998873MaRDI QIDQ3563778FDOQ3563778

János Pach, Rom Pinchasi

Publication date: 1 June 2010

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3647826

Recommendations

• On the maximum number of equilateral triangles. I
• The number of isosceles right triangles determined by \(n\) points in convex position in the plane
• The number of unit-area triangles in the plane: theme and variations
• Extremal problems on triangle areas in two and three dimensions
• An improved bound on the number of unit area triangles

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Cited In (6)

• Convex polyhedra in \(\mathbb{R}^3\) spanning \(\Omega(n^{4/3})\) congruent triangles
• On the maximum number of equilateral triangles. I
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• Extremal problems for convex geometric hypergraphs and ordered hypergraphs
• On the number of similar instances of a pattern in a finite set
• Small distances in convex polygons

This page was built for publication: How many unit equilateral triangles can be generated by \(N\) points in convex position?

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