On rich lenses in planar arrangements of circles and related problems

Esther Ezra; Orit E. Raz; Micha Sharir; Joshua Zahl

doi:10.4230/LIPIcs.SoCG.2021.35

On rich lenses in planar arrangements of circles and related problems

Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We show that the maximum number of pairwise non-overlapping k-rich lenses (lenses formed by at least k circles) in an arrangement of n circles in the plane is O(n^3/² log(n/k³)k⁻^5/2 + n/k), and the sum of the degrees of the lenses of such a family (where the degree of a lens is the number of circles that form it) is O(n^3/² log(n/k³)k⁻^3/2 + n). Two independent proofs of these bounds are given, each interesting in its own right (so we believe). We then show that these bounds lead to the known bound of Agarwal et al. (JACM 2004) and Marcus and Tardos (JCTA 2006) on the number of point-circle incidences in the plane. Extensions to families of more general algebraic curves and some other related problems are also considered.

Original language	English
Title of host publication	37th International Symposium on Computational Geometry, SoCG 2021
Editors	Kevin Buchin, Eric Colin de Verdiere
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959771849
DOIs	https://doi.org/10.4230/LIPIcs.SoCG.2021.35
State	Published - 1 Jun 2021
Event	37th International Symposium on Computational Geometry, SoCG 2021 - Virtual, Buffalo, United States Duration: 7 Jun 2021 → 11 Jun 2021

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	189
ISSN (Print)	1868-8969

Conference

Conference	37th International Symposium on Computational Geometry, SoCG 2021
Country/Territory	United States
City	Virtual, Buffalo
Period	7/06/21 → 11/06/21

Bibliographical note

Publisher Copyright:
© Esther Ezra, Orit E. Raz, Micha Sharir, and Joshua Zahl; licensed under Creative Commons License CC-BY 4.0 37th International Symposium on Computational Geometry (SoCG 2021).

Funding

Funding Esther Ezra: Work partially supported by NSF CAREER under grant CCF:AF-1553354 and by Grant 824/17 from the Israel Science Foundation. Micha Sharir: Work partially supported by ISF Grant 260/18, by grant 1367/2016 from the German-Israeli Science Foundation (GIF), and by Blavatnik Research Fund in Computer Science at Tel Aviv University. Joshua Zahl: Work supported by an NSERC Discovery Grant.

Funders	Funder number
Blavatnik Research Fund in Computer Science
German–Israeli Science Foundation
National Science Foundation	824/17, AF-1553354
Natural Sciences and Engineering Research Council of Canada
Israel Science Foundation	1367/2016, 260/18
Tel Aviv University

Keywords

Circles
Incidences
Lenses
Polynomial partitioning

Access to Document

10.4230/LIPIcs.SoCG.2021.35

Cite this

Ezra, E., Raz, O. E., Sharir, M., & Zahl, J. (2021). On rich lenses in planar arrangements of circles and related problems. In K. Buchin, & E. C. de Verdiere (Eds.), 37th International Symposium on Computational Geometry, SoCG 2021 Article 35 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 189). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2021.35

Ezra, Esther ; Raz, Orit E. ; Sharir, Micha et al. / On rich lenses in planar arrangements of circles and related problems. 37th International Symposium on Computational Geometry, SoCG 2021. editor / Kevin Buchin ; Eric Colin de Verdiere. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2021. (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{f64abbd685e44b7987a1865c64e64b6c,

title = "On rich lenses in planar arrangements of circles and related problems",

abstract = "We show that the maximum number of pairwise non-overlapping k-rich lenses (lenses formed by at least k circles) in an arrangement of n circles in the plane is O(n3/2 log(n/k3)k−5/2 + n/k), and the sum of the degrees of the lenses of such a family (where the degree of a lens is the number of circles that form it) is O(n3/2 log(n/k3)k−3/2 + n). Two independent proofs of these bounds are given, each interesting in its own right (so we believe). We then show that these bounds lead to the known bound of Agarwal et al. (JACM 2004) and Marcus and Tardos (JCTA 2006) on the number of point-circle incidences in the plane. Extensions to families of more general algebraic curves and some other related problems are also considered.",

keywords = "Circles, Incidences, Lenses, Polynomial partitioning",

author = "Esther Ezra and Raz, {Orit E.} and Micha Sharir and Joshua Zahl",

note = "Publisher Copyright: {\textcopyright} Esther Ezra, Orit E. Raz, Micha Sharir, and Joshua Zahl; licensed under Creative Commons License CC-BY 4.0 37th International Symposium on Computational Geometry (SoCG 2021).; 37th International Symposium on Computational Geometry, SoCG 2021 ; Conference date: 07-06-2021 Through 11-06-2021",

year = "2021",

month = jun,

day = "1",

doi = "10.4230/LIPIcs.SoCG.2021.35",

language = "אנגלית",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Kevin Buchin and {de Verdiere}, {Eric Colin}",

booktitle = "37th International Symposium on Computational Geometry, SoCG 2021",

address = "גרמניה",

}

Ezra, E, Raz, OE, Sharir, M & Zahl, J 2021, On rich lenses in planar arrangements of circles and related problems. in K Buchin & EC de Verdiere (eds), 37th International Symposium on Computational Geometry, SoCG 2021., 35, Leibniz International Proceedings in Informatics, LIPIcs, vol. 189, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 37th International Symposium on Computational Geometry, SoCG 2021, Virtual, Buffalo, United States, 7/06/21. https://doi.org/10.4230/LIPIcs.SoCG.2021.35

On rich lenses in planar arrangements of circles and related problems. / Ezra, Esther; Raz, Orit E.; Sharir, Micha et al.
37th International Symposium on Computational Geometry, SoCG 2021. ed. / Kevin Buchin; Eric Colin de Verdiere. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2021. 35 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 189).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On rich lenses in planar arrangements of circles and related problems

AU - Ezra, Esther

AU - Raz, Orit E.

AU - Sharir, Micha

AU - Zahl, Joshua

N1 - Publisher Copyright: © Esther Ezra, Orit E. Raz, Micha Sharir, and Joshua Zahl; licensed under Creative Commons License CC-BY 4.0 37th International Symposium on Computational Geometry (SoCG 2021).

PY - 2021/6/1

Y1 - 2021/6/1

N2 - We show that the maximum number of pairwise non-overlapping k-rich lenses (lenses formed by at least k circles) in an arrangement of n circles in the plane is O(n3/2 log(n/k3)k−5/2 + n/k), and the sum of the degrees of the lenses of such a family (where the degree of a lens is the number of circles that form it) is O(n3/2 log(n/k3)k−3/2 + n). Two independent proofs of these bounds are given, each interesting in its own right (so we believe). We then show that these bounds lead to the known bound of Agarwal et al. (JACM 2004) and Marcus and Tardos (JCTA 2006) on the number of point-circle incidences in the plane. Extensions to families of more general algebraic curves and some other related problems are also considered.

AB - We show that the maximum number of pairwise non-overlapping k-rich lenses (lenses formed by at least k circles) in an arrangement of n circles in the plane is O(n3/2 log(n/k3)k−5/2 + n/k), and the sum of the degrees of the lenses of such a family (where the degree of a lens is the number of circles that form it) is O(n3/2 log(n/k3)k−3/2 + n). Two independent proofs of these bounds are given, each interesting in its own right (so we believe). We then show that these bounds lead to the known bound of Agarwal et al. (JACM 2004) and Marcus and Tardos (JCTA 2006) on the number of point-circle incidences in the plane. Extensions to families of more general algebraic curves and some other related problems are also considered.

KW - Circles

KW - Incidences

KW - Lenses

KW - Polynomial partitioning

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

U2 - 10.4230/LIPIcs.SoCG.2021.35

DO - 10.4230/LIPIcs.SoCG.2021.35

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85108197153

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 37th International Symposium on Computational Geometry, SoCG 2021

A2 - Buchin, Kevin

A2 - de Verdiere, Eric Colin

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 37th International Symposium on Computational Geometry, SoCG 2021

Y2 - 7 June 2021 through 11 June 2021

ER -

Ezra E, Raz OE, Sharir M, Zahl J. On rich lenses in planar arrangements of circles and related problems. In Buchin K, de Verdiere EC, editors, 37th International Symposium on Computational Geometry, SoCG 2021. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2021. 35. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.SoCG.2021.35

On rich lenses in planar arrangements of circles and related problems

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this