Abstract
Let \(V = \{v_1, \dots , v_n\}\) be a set of n points in the plane and let \(x \in V\). An x-loop is a continuous closed curve not containing any point of V, except of passing exactly once through the point x. We say that two x-loops are non-homotopic if they cannot be transformed continuously into each other without passing through a point of V. For \(n=2\), we give an upper bound \(2^{O(k)}\) on the maximum size of a family of pairwise non-homotopic x-loops such that every loop has fewer than k self-intersections and any two loops have fewer than k intersections. This result is inspired by a very recent result of Pach, Tardos, and Tóth who proved the upper bounds \(2^{16k^4}\) for the slightly different scenario when \(x\not \in V\).
This research was initiated during the workshop KAMAK 2020 in Kytlice in Sept. 20–25, 2020. MŠ was supported by the Czech Science Foundation, grant number GJ20-27757Y, with institutional support RVO: 67985807. VB acknowledges the support of the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16_019/0000765 “Research Center for Informatics”. PV and MO were supported by project 18-19158S of the Czech Science Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ajtai, M., Chvátal, V., Newborn, M.M., Szemerédi, E.: Crossing-free subgraphs. In: Theory and Practice of Combinatorics. North-Holland Mathematics Studies, vol. 60, pp. 9–12. North-Holland, Amsterdam (1982). https://doi.org/10.1016/S0304-0208(08)73484-4
Leighton, F.T.: Complexity Issues in VLSI. Foundations of Computing. MIT Press, Cambridge (1983)
Pach, J., Tardos, G., Tóth, G.: Crossings between non-homotopic edges (2020). arXiv:2006.14908. To appear in LNCS, Springer, Proc. of Graph Drawing 2020
Acknowledgement
This research was initiated during the workshop KAMAK 2020 organized by two departments (KAM and IÚUK) of the Faculty of Mathematics and Physics, Charles University, in Kytlice in September 20–25, 2020. We thank the organizers and the participants of the workshop for creating a stimulating atmosphere and for helpful discussions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Blažej, V., Opler, M., Šileikis, M., Valtr, P. (2021). On the Intersections of Non-homotopic Loops. In: Mudgal, A., Subramanian, C.R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2021. Lecture Notes in Computer Science(), vol 12601. Springer, Cham. https://doi.org/10.1007/978-3-030-67899-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-67899-9_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-67898-2
Online ISBN: 978-3-030-67899-9
eBook Packages: Computer ScienceComputer Science (R0)