On the number of touching pairs in a set of planar curves

DOI10.1016/j.comgeo.2017.10.004zbMath1386.68198arXiv1511.05425OpenAlexW2963683113MaRDI QIDQ1693324

Bálint Hujter, Sándor Kisfaludi-Bak, Péter Györgyi

Publication date: 12 February 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.05425

zbMATH Keywords

combinatorial geometrypseudo-segmentstouching curves

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal problems in discrete geometry
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
• How to cut pseudoparabolas into segments
• Cutting circles into pseudo-segments and improved bounds for incidences
• Intersection reverse sequences and geometric applications.
• Crossing-Free Subgraphs
• On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
• Beyond the Richter-Thomassen Conjecture
• Intersection patterns of curves
• Lenses in arrangements of pseudo-circles and their applications