A Universal Symmetry Detection Algorithm
Abstract
Research on symmetry detection focuses on
identifying and detecting new types of symmetry. We present 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.