A universal symmetry detection algorithm

Research on symmetry detection focuses on identifying and detecting new types of symmetry. The paper presents an algorithm that is capable of detecting any type of permutation-based symmetry, including many types for which there are no existing algorithms. General symmetry detection is library-based...

Full description

Saved in:
Bibliographic Details
Published inSpringerPlus Vol. 4; no. 1; pp. 418 - 30
Main Author Maurer, Peter M
Format Journal Article
LanguageEnglish
Published Cham Springer International Publishing 14.08.2015
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN2193-1801
2193-1801
DOI10.1186/s40064-015-1156-7

Cover

More Information
Summary:Research on symmetry detection focuses on identifying and detecting new types of symmetry. The paper presents an algorithm that is capable of detecting any type of permutation-based symmetry, including many types for which there are no existing algorithms. General symmetry detection is library-based, but symmetries that can be parameterized, (i.e. total, partial, rotational, and dihedral symmetry), can be detected without using libraries. In many cases it is faster than existing techniques. Furthermore, it is simpler than most existing techniques, and can easily be incorporated into existing software. The algorithm can also be used with virtually any type of matrix-based symmetry, including conjugate symmetry.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2193-1801
2193-1801
DOI:10.1186/s40064-015-1156-7