Cutting circles into pseudo-segments and improved bounds for incidences
From MaRDI portal
Publication:1864110
DOI10.1007/s00454-001-0084-1zbMath1050.68143OpenAlexW2035884884MaRDI QIDQ1864110
Publication date: 17 March 2003
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-001-0084-1
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38)
Related Items
On the diameter of separated point sets with many nearly equal distances, A crossing lemma for Jordan curves, Counting and Cutting Rich Lenses in Arrangements of Circles, Cutting algebraic curves into pseudo-segments and applications, A refined energy bound for distinct perpendicular bisectors, The number of unit distances is almost linear for most norms, On the number of touching pairs in a set of planar curves, Arrangements of pseudocircles: on digons and triangles, Improved Bounds for Incidences Between Points and Circles, On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves, On the number of discrete chains, Nearly equal distances and Szemerédi's regularity lemma, Intersection reverse sequences and geometric applications., Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique, Non-Degenerate Spheres in Three Dimensions, Geometric incidence theorems via Fourier analysis, Extremal problems on triangle areas in two and three dimensions, From harmonic analysis to arithmetic combinatorics
