Abstract
Let \(\mathcal{A}\) and \(\mathcal{B}\) be two families of two-way infinite x-monotone curves, no three of which pass through the same point. Assume that every curve in \(\mathcal{A}\) lies above every curve in \(\mathcal{B}\) and that there are m pairs of curves, one from \(\mathcal{A}\) and the other from \(\mathcal{B}\), that are tangent to each other. Then the number of proper crossings among the members of \(\mathcal A\cup\mathcal B\) is at least (1/2 − o(1))m ln m. This bound is almost tight.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chan, T.M.: On levels in arrangements of curves, II: A simple inequality and its consequences. Discrete & Computational Geometry 34(1), 11–24 (2005)
Koebe, P.: Kontaktprobleme der konforman abbildung. Berichte über die Verhandlungen d. Sächs. Akademie der Wissenschaften Leipzig 88, 141–164 (1936)
Mubayi, D.: Intersecting curves in the plane. Graphs and Combinatorics 18(3), 583–589 (2002)
Erdös, P.: On sets of distances of n points. The American Mathematical Monthly 53, 248–250 (1946)
Pach, J., Agarwal, P.K.: Combinatorial Geometry. Wiley, New York (1995)
Richter, R.B., Thomassen, C.: Intersection of curves systems and the crossing number of C 5×C 5. Discrete & Computational Geometry 13, 149–159 (1995)
Ruskey, F., Weston, M.: Venn diagram survey. Electronic Journal of Combinatorics DS#5 (2005)
Salazar, G.: On the intersections of systems of curves. Journal of Combinatorial Theory Series B 75, 56–60 (1999)
Venn, J.: On the diagrammatic and mechanical representation of propositions and reasonings. Philosophical Magazine and Journal of Science, Series 5 10(59) (1880)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fox, J., Frati, F., Pach, J., Pinchasi, R. (2010). Crossings between Curves with Many Tangencies. In: Rahman, M.S., Fujita, S. (eds) WALCOM: Algorithms and Computation. WALCOM 2010. Lecture Notes in Computer Science, vol 5942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11440-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-11440-3_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11439-7
Online ISBN: 978-3-642-11440-3
eBook Packages: Computer ScienceComputer Science (R0)