Document Open Access Logo

The Number of Unit-Area Triangles in the Plane: Theme and Variations

Authors Orit E. Raz, Micha Sharir

PDF

File

Thumbnail PDF
PDF
LIPIcs.SOCG.2015.569.pdf
  • Filesize: 0.53 MB
  • 15 pages

Document Identifiers

Subject Classification

Keywords
  • Combinatorial geometry
  • incidences
  • repeated configurations

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We show that the number of unit-area triangles determined by a set S of n points in the plane is O(n^{20/9}), improving the earlier bound O(n^{9/4}) of Apfelbaum and Sharir. We also consider two special cases of this problem: (i) We 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 Omega(n^2), for any triple of lines (it is always O(n^2) in this case). (ii) We show that if S is a convex grid of the form A x B, where A, B are convex sets of n^{1/2} real numbers each (i.e., the sequences of differences of consecutive elements of A and of B are both strictly increasing), then S determines O(n^{31/14}) unit-area triangles.

Cite As Get BibTex

Orit E. Raz and Micha Sharir. The Number of Unit-Area Triangles in the Plane: Theme and Variations. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 569-583, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015) https://doi.org/10.4230/LIPIcs.SOCG.2015.569

Author Details

Orit E. Raz
Micha Sharir
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact