An improved bound on the number of unit area triangles

15 years 10 months ago

Download www.cs.tau.ac.il

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.

Roel Apfelbaum, Micha Sharir

Real-time Traffic

COMPGEOM 2009 | Discrete Geometry | Dumitrescu Et | Unit-area Triangles |

claim paper

» New Lower Bounds for Heilbronn Numbers

» Mesh quality improvement and other properties in the fourtriangles longestedge partition

» Distinct Triangle Areas in a Planar Point Set

» Bounds for solid angles of lattices of rank three

» New Streaming Algorithms for Counting Triangles in Graphs

» Practical Spherical Embedding of Manifold Triangle Meshes

» Time and area efficient pattern matching on FPGAs

» Online Ramsey games for triangles in random graphs

Post Info
More Details (n/a)

Added	28 May 2010
Updated	28 May 2010
Type	Conference
Year	2009
Where	COMPGEOM
Authors	Roel Apfelbaum, Micha Sharir

Comments (0)

Sciweavers

An improved bound on the number of unit area triangles

COMPGEOM 2009 | Discrete Geometry | Dumitrescu Et | Unit-area Triangles |

Explore & Download

Productivity Tools

Sciweavers