An easy and fast algorithm for obtaining minimal discrete knots

摘要

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.