[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3356422.3356438acmotherconferencesArticle/Chapter ViewAbstractPublication PagesvinciConference Proceedingsconference-collections
research-article

Visually Communicating Mathematical Knot Deformation

Published: 20 September 2019 Publication History

Abstract

Mathematical knots are different from everyday ropes in that they are infinitely stretchy and flexible when being deformed into their ambient isotopic. For this reason, a number of challenges arise when visualizing mathematical knot's static and changing structures during topological deformation. In this paper we focus on computational methods to visually communicate the mathematical knot's dynamics by computationally simulating the topological deformation and capturing the critical changes during the entire simulation. To further improve our visual experience, we propose a fast and adaptive method to extract key moments where only critical changes occur to represent and summarize the long deformation sequence. We conduct evaluation study to showcase the efficacy and efficiency of our methods.

References

[1]
Colin Conrad Adams. 2004. The knot book: an elementary introduction to the mathematical theory of knots. American Mathematical Soc.
[2]
Mathias Carlen. 2010. Computation and visualization of ideal knot shapes. Technical Report. EPFL.
[3]
Jasmine Cashbaugh and Christopher Kitts. 2018. Automatic Calculation of a Transformation Matrix Between Two Frames. IEEE Access 6 (2018), 9614--9622.
[4]
Christian Colin. 1988. A system for exploring the universe of polyhedral shapes. In Eurographics 88.
[5]
Gennaro Costagliola, Mattia De Rosa, Andrew Fish, Vittorio Fuccella, Rafiq Saleh, and Sarah Swartwood. 2016. KnotSketch: a tool for knot diagram sketching, encoding and re-generation. Journal of Visual Languages and Sentient Systems 2 (2016), 16--25.
[6]
Peter Eades. 1984. A heuristic for graph drawing. Congressus numerantium 42 (1984), 149--160.
[7]
Cesim Erten, Philip J Harding, Stephen G Kobourov, Kevin Wampler, and Gary Yee. 2004. Exploring the computing literature using temporal graph visualization. In Visualization and Data Analysis 2004, Vol. 5295. International Society for Optics and Photonics, 45--56.
[8]
Michael R Garey and David S Johnson. 1983. Crossing number is NP-complete. SIAM Journal on Algebraic Discrete Methods 4, 3 (1983), 312--316.
[9]
David Harel and Yehuda Koren. 2000. A fast multi-scale method for drawing large graphs. In International symposium on graph drawing. Springer, 183--196.
[10]
Stephen G Kobourov. 2012. Spring embedders and force directed graph drawing algorithms. arXiv preprint arXiv:1201.3011 (2012).
[11]
Chang Ha Lee, Amitabh Varshney, and David W Jacobs. 2005. Mesh saliency. In ACM transactions on graphics (TOG), Vol. 24. ACM, 659--666.
[12]
Juan Lin and Zhang Hui. 2019. Visualizing mathematical knot equivalence. In IS&T International Symposium on Electronic Imaging 2019, Visualization and Data Analysis 2019 proceedings (VDA 2019). Society for Imaging Science and Technology. https://doi.org/10.2352/ISSN.2470-1173.2019.1.VDA-683
[13]
Roger Penrose. 1955. A generalized inverse for matrices. In Mathematical proceedings of the Cambridge philosophical society, Vol. 51. Cambridge University Press, 406--413.
[14]
Marcus Schaefer. 2013. The graph crossing number and its variants: A survey. The electronic journal of combinatorics 1000 (2013), 21--22.
[15]
Robert Glenn Scharein. 1998. Interactive Topological Drawing. Ph.D. Dissertation. Citeseer.
[16]
Jonathan K Simon. 1994. Energy functions for polygonal knots. Journal of Knot Theory and its Ramifications 3, 03 (1994), 299--320.
[17]
Scott Snibbe, Sean Anderson, and Bill Verplank. 1998. Springs and constraints for 3d drawing. In Proceedings of the Third Phantom Users Group Workshop.
[18]
Bruce Trace. 1983. On the Reidemeister moves of a classical knot. Proc. Amer. Math. Soc. (1983), 722--724.
[19]
Pere-Pau Vázquez, Miquel Feixas, Mateu Sbert, and Wolfgang Heidrich. 2001. Viewpoint selection using viewpoint entropy. In VMV, Vol. 1. 273--280.
[20]
Pere-Pau Vázquez and Mateu Sbert. 2003. Fast adaptive selection of best views. In International Conference on Computational Science and Its Applications. Springer, 295--305.
[21]
YingQing Wu. [n.d.]. An Md Knot Energy Minimizing Program. Department of Mathematics, University of Iowa.
[22]
Hui Zhang, Sidharth Thakur, and Andrew J Hanson. 2007. Haptic exploration of mathematical knots. In International Symposium on Visual Computing. Springer, 745--756.
[23]
Hui Zhang, Jianguang Weng, Lin Jing, and Yiwen Zhong. 2012. Knotpad: Visualizing and exploring knot theory with fluid reidemeister moves. IEEE transactions on visualization and computer graphics 18, 12 (2012), 2051--2060.
[24]
H. Zhang, J. Weng, and G. Ruan. 2014. Visualizing 2-dimensional manifolds with curve handles in 4d. IEEE Transactions on Visualization & Computer Graphics 1 (2014), 1--1.
[25]
H. Zhang, Y. Zhong, and J. Jiang. 2016. Visualizing knots and braids with touchable 3D manipulatives. In 2016 IEEE Pacific Visualization Symposium (PacificVis). 24--31. https://doi.org/10.1109/PACIFICVIS.2016.7465247

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
VINCI '19: Proceedings of the 12th International Symposium on Visual Information Communication and Interaction
September 2019
201 pages
ISBN:9781450376266
DOI:10.1145/3356422
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

  • East China Normal University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 September 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Knot untanglement
  2. Least squares fitting
  3. View selection

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

VINCI'2019

Acceptance Rates

Overall Acceptance Rate 71 of 193 submissions, 37%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media