Counting and Cutting Rich Lenses in Arrangements of Circles

DOI10.1137/21M1409305zbMath1486.52056OpenAlexW4223435218MaRDI QIDQ5071100

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

Publication date: 20 April 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/21m1409305

zbMATH Keywords

incidence geometrypolynomial partitioninglens cutting

Mathematics Subject Classification ID

Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Cites Work

• Unnamed Item
• On the Erdős distinct distances problem in the plane
• Extremal problems in discrete geometry
• Combinatorial complexity bounds for arrangements of curves and spheres
• How to cut pseudoparabolas into segments
• Almost tight bounds for eliminating depth cycles in three dimensions
• Cutting circles into pseudo-segments and improved bounds for incidences
• Incidences between points and curves with almost two degrees of freedom
• Cutting algebraic curves into pseudo-segments and applications
• Intersection reverse sequences and geometric applications.
• On the Number of Incidences Between Points and Curves
• New bounds on curve tangencies and orthogonalities
• Breaking the 3/2 Barrier for Unit Distances in Three Dimensions
• Polynomial partitioning for a set of varieties
• Improved Bounds for Incidences Between Points and Circles
• Lenses in arrangements of pseudo-circles and their applications

This page was built for publication: Counting and Cutting Rich Lenses in Arrangements of Circles