An algorithm for generating a family of alternating knots (Q415783)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for generating a family of alternating knots |
scientific article; zbMATH DE number 6031962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for generating a family of alternating knots |
scientific article; zbMATH DE number 6031962 |
Statements
An algorithm for generating a family of alternating knots (English)
0 references
9 May 2012
0 references
Summary: An algorithm for generating a family of alternating knots (which are described by means of a chain code) is presented. The family of alternating knots is represented on the cubic lattice, that is, each alternating knot is composed of constant orthogonal straight-line segments and is described by means of a chain code. This chain code is represented by a numerical string of finite length over a finite alphabet, allowing the usage of formal-language techniques for alternating-knot representation. When an alternating knot is described by a chain, it is possible to obtain its mirror image in an easy way. Also, we have a compression efficiency for representing alternating knots, because chain codes preserve information and allow a considerable data reduction.
0 references
alternating knots
0 references
algorithm
0 references
cubic lattice
0 references
chain code
0 references
mirror image
0 references
0.822376549243927
0 references
0.805142343044281
0 references
0.7717171907424927
0 references
0.7501158714294434
0 references
