Abstract
We show that the number of unit-area triangles determined by a set S of n points in the plane is O(n20/9), improving the earlier bound O(n9/4) of Apfelbaum and Sharir [2]. We also show, using a somewhat subtle construction, that if S consists of points on three lines, the number of unit-area triangles that S spans can be Ω(n2), for any triple of lines (it is always O(n2) in this case).
Original language | English |
---|---|
Pages (from-to) | 1221-1240 |
Number of pages | 20 |
Journal | Combinatorica |
Volume | 37 |
Issue number | 6 |
DOIs | |
State | Published - 1 Dec 2017 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Computational Mathematics