| An improved bound on the number of unit area triangles |
| Full text |
Pdf
(471 KB)
|
Source
|
Annual Symposium on Computational Geometry
archive
Proceedings of the 25th annual symposium on Computational geometry
table of contents
Aarhus, Denmark
SESSION: Tuesday, June 9, 9:00-10:20am
table of contents
Pages 135-140
Year of Publication: 2009
ISBN:978-1-60558-501-7
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 33, Citation Count: 0
|
|
|
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
B. Chazelle, Cuttings, In "Handbook of Data Structures and Applications" (D. Mehta and S. Sahni, editors), chap. 25, Chapman and Hall/CRC Press, 2005.
|
| |
2
|
|
 |
3
|
|
| |
4
|
P. Erdos and G. Purdy, Some extremal problems in geometry, J. Combinat. Theory 10 (1971), 246--252.
|
| |
5
|
|
| |
6
|
T. Kovari, V. T. Sos, and P. Turan, On a problem of K. Zarankiewicz, Colloquium Math. 3 (1954), 50--57.
|
| |
7
|
|
| |
8
|
I. R. Shafarevich, Basic Algebraic Geometry, Springer-Verlag, 1977.
|
| |
9
|
|
| |
10
|
E. Szemeredi and W. T. Trotter, Extremal problems in discrete geometry, Combinatorica 3 (1983), 381--392.
|
|