On the number of unit-area triangles spanned by convex grids in the plane

Orit E. Raz; Micha Sharir; Ilya D. Shkredov

doi:10.1016/j.comgeo.2016.12.002

On the number of unit-area triangles spanned by convex grids in the plane

Orit E. Raz^*, Micha Sharir, Ilya D. Shkredov

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

A finite set of real numbers is called convex if the differences between consecutive elements form a strictly increasing sequence. We show that, for any pair of convex sets A,B⊂R, each of size n^1/2, the convex grid A×B spans at most O(n^37/17log^2/17⁡n) unit-area triangles. Our analysis also applies to more general families of sets A, B, known as sets of Szemerédi–Trotter type.

Original language	English
Pages (from-to)	25-33
Number of pages	9
Journal	Computational Geometry: Theory and Applications
Volume	62
DOIs	https://doi.org/10.1016/j.comgeo.2016.12.002
State	Published - 1 Apr 2017
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2016 Elsevier B.V.

Keywords

Cobinatorial geometry
Convex sets
Repeated Configurations

Access to Document

10.1016/j.comgeo.2016.12.002

Cite this

@article{346d0d81f1c24fecb5023218d722d198,

title = "On the number of unit-area triangles spanned by convex grids in the plane",

abstract = "A finite set of real numbers is called convex if the differences between consecutive elements form a strictly increasing sequence. We show that, for any pair of convex sets A,B⊂R, each of size n1/2, the convex grid A×B spans at most O(n37/17log2/17⁡n) unit-area triangles. Our analysis also applies to more general families of sets A, B, known as sets of Szemer{\'e}di–Trotter type.",

keywords = "Cobinatorial geometry, Convex sets, Repeated Configurations",

author = "Raz, {Orit E.} and Micha Sharir and Shkredov, {Ilya D.}",

note = "Publisher Copyright: {\textcopyright} 2016 Elsevier B.V.",

year = "2017",

month = apr,

day = "1",

doi = "10.1016/j.comgeo.2016.12.002",

language = "אנגלית",

volume = "62",

pages = "25--33",

journal = "Computational Geometry: Theory and Applications",

issn = "0925-7721",

publisher = "Elsevier",

}

TY - JOUR

T1 - On the number of unit-area triangles spanned by convex grids in the plane

AU - Raz, Orit E.

AU - Sharir, Micha

AU - Shkredov, Ilya D.

PY - 2017/4/1

Y1 - 2017/4/1

N2 - A finite set of real numbers is called convex if the differences between consecutive elements form a strictly increasing sequence. We show that, for any pair of convex sets A,B⊂R, each of size n1/2, the convex grid A×B spans at most O(n37/17log2/17⁡n) unit-area triangles. Our analysis also applies to more general families of sets A, B, known as sets of Szemerédi–Trotter type.

AB - A finite set of real numbers is called convex if the differences between consecutive elements form a strictly increasing sequence. We show that, for any pair of convex sets A,B⊂R, each of size n1/2, the convex grid A×B spans at most O(n37/17log2/17⁡n) unit-area triangles. Our analysis also applies to more general families of sets A, B, known as sets of Szemerédi–Trotter type.

KW - Cobinatorial geometry

KW - Convex sets

KW - Repeated Configurations

UR - http://www.scopus.com/inward/record.url?scp=85008414347&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2016.12.002

DO - 10.1016/j.comgeo.2016.12.002

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85008414347

SN - 0925-7721

VL - 62

SP - 25

EP - 33

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

ER -

On the number of unit-area triangles spanned by convex grids in the plane

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this