A Linear Time Algorithm for Visualizing Knotted Structures in 3 Pages

Vitaliy Kurlin

2015

Abstract

We introduce simple codes and fast visualization tools for knotted structures in molecules and neural 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 by an abstract Gauss code. First we recognize in linear time if an abstract Gauss code represents an actual 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 line. The running time of our drawing algorithm is linear in the length of a Gauss code of a given graph. Three-page embeddings provide simple linear codes of knotted graphs so that the isotopy problem for all graphs in 3-space completely reduces to a word problem in finitely presented semigroups.

References

  1. Bernhart, F., Kainen, P. (1979) The book thickness of a graph. J. Combin. Theory B, v. 27, p. 320-331.
  2. Biasotti, S., Giorgi, D., Spagnuolo, Falcidieno, M. (2008) Reeb graphs for shape analysis and applications. Theoretical Computer Science, v. 392, p. 5-22.
  3. Brendel, P., Dlotko, P., Ellis, G., Juda, M., Mrozek, M. (2015) Computing fundamental groups from point clouds. Applicable Algebra in Engineering, Communication and Computing, to appear.
  4. Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S. (2005) Curve-constrained drawings of planar graphs. Computational Geometry, v. 30, p. 1-23.
  5. Enomoto, H., Miyauchi, M. (1999) Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph. SIAM J. Discrete Mathematics, v. 12, p. 337-341.
  6. Kauffman, L. (1989) Invariants of graphs in three-space. Trans. Amer. Math. Soc., v. 311, p. 697-710.
  7. Kearton, C., Kurlin, V. (2008) All 2-dimensional links live inside a universal 3-dimensional polyhedron. Algebraic and Geometric Topology, v. 8 (2008), no. 3, p. 1223-1247.
  8. Kurlin, V. (2007) Dynnikov three-page diagrams of spatial 3-valent graphs. Functional Analysis and Its Applications, v. 35 (2001), no. 3, p. 230-233.
  9. Kurlin, V. (2007) Three-page encoding and complexity theory for spatial graphs. J. Knot Theory Ramifications, v. 16, no. 1, p. 59-102.
  10. Kurlin, V. (2008) Gauss paragraphs of classical links and a characterization of virtual link groups. Mathematical Proceedings of Cambridge Phil. Society, v. 145 , no. 1, p. 129-140.
  11. Kurlin, V., Vershinin, V. (2004) Three-page embeddings of singular knots. Functional Analysis and Its Applications, v. 38 (2004), no. 1, p. 14-27.
  12. Schölkopf, B. and Smola, A. (2002) Learning with kernels. MIT Press, Cambridge, MA.
  13. Tkalec, U., Ravnik, M., opar, S., umer, S., Muevi, I. (2011) Reconfigurable Knots and Links in Chiral Nematic Colloids. Science, v. 333, no. 6038 pp. 62-65,
  14. Yannakakis, M. (1989) Embedding planar graphs in four pages. J. Comp. System Sciences, v. 38, p. 36-67.
Download


Paper Citation


in Harvard Style

Kurlin V. (2015). A Linear Time Algorithm for Visualizing Knotted Structures in 3 Pages . In Proceedings of the 6th International Conference on Information Visualization Theory and Applications - Volume 1: IVAPP, (VISIGRAPP 2015) ISBN 978-989-758-088-8, pages 5-16. DOI: 10.5220/0005259900050016


in Bibtex Style

@conference{ivapp15,
author={Vitaliy Kurlin},
title={A Linear Time Algorithm for Visualizing Knotted Structures in 3 Pages},
booktitle={Proceedings of the 6th International Conference on Information Visualization Theory and Applications - Volume 1: IVAPP, (VISIGRAPP 2015)},
year={2015},
pages={5-16},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005259900050016},
isbn={978-989-758-088-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Information Visualization Theory and Applications - Volume 1: IVAPP, (VISIGRAPP 2015)
TI - A Linear Time Algorithm for Visualizing Knotted Structures in 3 Pages
SN - 978-989-758-088-8
AU - Kurlin V.
PY - 2015
SP - 5
EP - 16
DO - 10.5220/0005259900050016