An Improved Bound on the Number of Unit Area Triangles

Details An Improved Bound on the Number of Unit Area Triangles An Improved Bound on the Number of Unit Area Triangles

2010-01-26

arxiv.org/abs/1001.4764v1

Proceedings of the 25th annual symposium on Computational geometry (2009) 135--140

Computer Science

Computational Geometry

12 pages, 2 figures, appeared in the 25th Annual Symposium on Computational Geometry (2009), submitted to "Discrete and Comput

Scientific paper

We show that the number of unit-area triangles determined by a set of $n$
points in the plane is $O(n^{9/4+\epsilon})$, for any $\epsilon>0$, improving
the recent bound $O(n^{44/19})$ of Dumitrescu et al.

Affiliated with

Also associated with

No associations

Rating

An Improved Bound on the Number of Unit Area Triangles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Improved Bound on the Number of Unit Area Triangles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Improved Bound on the Number of Unit Area Triangles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-645364