An improved bound on the number of unit area triangles

Authors:
Roel Apfelbaum;Micha Sharir
Affiliations:
Tel Aviv University, Tel Aviv, Israel;Tel Aviv University, Tel Aviv, Israel
Venue:
Proceedings of the twenty-fifth annual symposium on Computational geometry
Year:
2009

Citing 5
Cited 0

Combinatorial complexity bounds for arrangements of curves and spheres

Discrete & Computational Geometry - Special issue on the complexity of arrangements
Repeated angles in the plane and related problems

Journal of Combinatorial Theory Series A
Extremal problems in combinatorial geometry

Handbook of combinatorics (vol. 1)
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
Extremal problems on triangle areas in two and three dimensions

Proceedings of the twenty-fourth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the number of unit-area triangles determined by a set of n points in the plane is O(n9/4+ε), for any ε0, improving the recent bound O(n44/19) of Dumitrescu et al.