Abstract
An easy and fast algorithm for obtaining minimal discrete knots is presented. A minimal discrete knot is the digitalized representation of a knot, which is composed of the minimum number of constant orthogonal straight-line segments and is represented by the knot-number notation. The proposed algorithm for obtaining minimal discrete knots tries to reduce the number of straight-line segments of a given discrete knot preserving its shape. This algorithm is based on two fundamental transformations: U and L. In order to prove the efficiency and rapidity of the algorithm, a great variety of examples of discrete knots are presented: complete families of discrete knots at different orders; random discrete knots; examples of non-trivial and unsolved discrete knots.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
