Extremal problems on triangle areas in two and three dimensions

DOI10.1016/j.jcta.2009.03.008zbMath1179.52026arXiv0710.4109OpenAlexW2963234396MaRDI QIDQ1040833

Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth

Publication date: 26 November 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0710.4109

zbMATH Keywords

extremal combinatoricscrossing numbergeometric incidencesdistinct triangle areasincidences between points and curvesincidences between points and cylindersmaximum-area trianglesminimum-area trianglesunit-area triangles

Mathematics Subject Classification ID

Length, area, volume and convex sets (aspects of convex geometry) (52A38) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (4)

On the number of unit-area triangles spanned by convex grids in the plane ⋮ An improved bound on the number of unit area triangles ⋮ Triangle areas in line arrangements ⋮ The number of unit-area triangles in the plane: theme and variation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Extremal problems in discrete geometry
• On the maximum number of edges in quasi-planar graphs
• Combinatorial complexity bounds for arrangements of curves and spheres
• On regular vertices of the union of planar convex objects
• Repeated angles in the plane and related problems
• Quasi-planar graphs have a linear number of edges
• Optimal slope selection via cuttings
• On distinct sums and distinct distances.
• Convex polyhedra in \(\mathbb{R}^3\) spanning \(\Omega(n^{4/3})\) congruent triangles
• Cutting circles into pseudo-segments and improved bounds for incidences
• Almost tight upper bounds for the single cell and zone problems in the three dimensions
• Intersection reverse sequences and geometric applications.
• Research Problems in Discrete Geometry
• On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
• The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane
• New lower bound techniques for VLSI
• Crossing-Free Subgraphs
• The Directions Determined by n Points in the Plane
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Distinct Triangle Areas in a Planar Point Set
• Lenses in arrangements of pseudo-circles and their applications
• On a problem of K. Zarankiewicz
• On Sets of Distances of n Points
• On a problem in combinatorial geometry
• Some extremal problems in geometry
• Distinct distances in the plane
• Triangles of extremal area or perimeter in a finite planar point set

This page was built for publication: Extremal problems on triangle areas in two and three dimensions