On the number of tangencies among 1-intersecting x-monotone curves

DOI10.1016/J.EJC.2024.103929MaRDI QIDQ6201909zbMATH OpenOpenAlexFDO

Authors Eyal Ackerman, Balázs Keszegh

Publication date 26 March 2024

Published in European Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejc.2024.103929

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Convex sets in (2) dimensions (including convex curves) (52A10) Combinatorial complexity of geometric structures (52C45) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The number of tangencies between two families of curves
• On the Richter-Thomassen conjecture about pairwise intersecting closed curves
• On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
• On the number of touching pairs in a set of planar curves
• A crossing lemma for Jordan curves

Cites work

• A crossing lemma for Jordan curves
• Coloring Delaunay-edges and their generalizations
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
• Lenses in arrangements of pseudo-circles and their applications
• On a conjecture of Károly Bezdek and János Pach
• On Sets of Distances of n Points
• On the intersections of systems of curves
• On the number of touching pairs in a set of planar curves
• On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves
• On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
• Tangencies between families of disjoint regions in the plane
• The maximum number of tangencies among convex regions with a triangle-free intersection graph
• The number of tangencies between two families of curves
• Turán problems for edge-ordered graphs

Cited in

(2)

• The number of tangencies between two families of curves
• Saturation of edge-ordered graphs

This page was built for publication: On the number of tangencies among 1-intersecting \(x\)-monotone curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201909)