A Linear Time Algorithm for Embedding Arbitrary Knotted Graphs into a 3-Page Book

We introduce simple codes and fast visualization tools for knotted structures in complicated molecules and brain networks. Knots, links and more general knotted graphs are studied up to an ambient isotopy in Euclidean 3-space. A knotted graph can be represented by a plane diagram or a Gauss code. First we recognize in linear time if an abstract Gauss code represents a graph embedded in 3-space. Second we design a fast algorithm for drawing any knotted graph in the 3-page book, which is a union of 3 half-planes along their common boundary. The complexity of the algorithm is linear in the length of a Gauss code. Three-page embeddings are encoded in such a way that the isotopy classification for graphs in 3-space reduces to a word problem in finitely presented semigroups.

[1]  Emilio Di Giacomo,et al.  Curve-constrained drawings of planar graphs , 2005, Comput. Geom..

[2]  Виталий Александрович Курлин,et al.  Трехстраничные вложения сингулярных узлов@@@Three-Page Embeddings of Singular Knots , 2004 .

[3]  Vitaliy Kurlin,et al.  Gauss paragraphs of classical links and a characterization of virtual link groups , 2006, Mathematical Proceedings of the Cambridge Philosophical Society.

[4]  Daniela Giorgi,et al.  Reeb graphs for shape analysis and applications , 2008, Theor. Comput. Sci..

[5]  Hikoe Enomoto,et al.  Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph , 1999, Discret. Appl. Math..

[6]  Paul C. Kainen,et al.  The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[7]  Vitaliy Kurlin,et al.  A Linear Time Algorithm for Visualizing Knotted Structures in 3 Pages , 2015, IVAPP.

[8]  Pawel Dlotko,et al.  Computing fundamental groups from point clouds , 2015, Applicable Algebra in Engineering, Communication and Computing.

[9]  Alexander J. Smola,et al.  Learning with kernels , 1998 .

[10]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[11]  V. Kurlin,et al.  All 2–dimensional links in 4–space live inside a universal 3–dimensional polyhedron. , 2008, 0801.3647.

[12]  Mihalis Yannakais,et al.  Embedding planar graphs in four pages , 1989, STOC 1989.

[13]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[14]  V. Kurlin.  Computing invariants of knotted graphs given by sequences of points in 3-dimensional space. , 2015 .

[15]  Vitaliy Kurlin,et al.  THREE-PAGE ENCODING AND COMPLEXITY THEORY FOR SPATIAL GRAPHS , 2004 .

[16]  Igor Muševič,et al.  Reconfigurable Knots and Links in Chiral Nematic Colloids , 2011, Science.

[17]  Hikoe Enomoto,et al.  Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine , 1999, SIAM J. Discret. Math..

[18]  L. Kauffman.  Invariants of graphs in three-space , 1989 .