Untangling Two Systems of Noncrossing Curves

We consider two systems α 1,',α m and β 1,',β n of curves drawn on a compact two-dimensional surface $\mathcal{M}$ with boundary. Each α i and each β j is either an arc meeting the boundary of $\mathcal{M}$ at its two endpoints, or a closed curve. The α i are pairwise disjoint except for possibly sharing endpoints, and similarly for the β j . We want to "untangle" the β j from the α i by a self-homeomorphism of $\mathcal{M}$ ; more precisely, we seek an homeomorphism $\varphi\:\mathcal{M}\to\mathcal{M}$ fixing the boundary of $\mathcal{M}$ pointwise such that the total number of crossings of the α i with the i¾?β j is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if $\mathcal{M}$ is planar, i.e., a sphere with hi¾?0 boundary components "holes", then Omn crossings can be achieved independently of h, which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary orientable or nonorientable surface $\mathcal{M}$ with h holes and of orientable or nonorientable genus gi¾?0, we obtain an Om+n4 upper bound, again independent of h and g.

[1]  W. B. R. Lickorish,et al.  A Representation of Orientable Combinatorial 3-Manifolds , 1962 .

[2]  Stephen G. Kobourov,et al.  Simultaneous Embedding of Planar Graphs , 2012, Handbook of Graph Drawing and Visualization.

[3]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[4]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[5]  Anne Verroust-Blondet,et al.  Computing a canonical polygonal schema of an orientable triangulated surface , 2001, SCG '01.

[6]  Jirí Matousek,et al.  Hardness of embedding simplicial complexes in Rd , 2009, SODA.

[7]  J. Stillwell Classical topology and combinatorial group theory , 1980 .

[8]  Chee-Keng Yap,et al.  Computational complexity of combinatorial surfaces , 1990, SCG '90.

[9]  R. Ho Algebraic Topology , 2022 .

[10]  Erik D. Demaine,et al.  Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.

[11]  Benson Farb,et al.  A primer on mapping class groups , 2013 .

[12]  Marcus Schaefer,et al.  Recognizing string graphs in NP , 2002, STOC '02.

[13]  J. Hyppolite At The École Normale Supérieure) , 1962 .

[14]  Eric Sedgwick,et al.  Decision problems in the space of Dehn fillings , 1998 .

[15]  Jeffrey R. Weeks,et al.  Conway's ZIP Proof , 1999 .

[16]  P. Giblin Graphs, surfaces, and homology , 1977 .

[17]  Jan Kratochvíl,et al.  String graphs requiring exponential representations , 1991, J. Comb. Theory, Ser. B.

[18]  Benson Farb,et al.  A Primer on Mapping Class Groups (Pms-49) , 2011 .

[19]  Bojan Mohar,et al.  Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs , 2007, Discret. Comput. Geom..

[20]  Michael Kaufmann,et al.  Journal of Graph Algorithms and Applications Embedding Vertices at Points: Few Bends Suffice for Planar Graphs , 2022 .