A Universal Symmetry Detection Algorithm

Simple item page
dc.contributor.authorMaurer, Peter M.
dc.date.accessioned2013-09-20T07:38:22Z
dc.date.available2013-09-20T07:38:22Z
dc.date.issued2013-09-20
dc.description.abstractResearch 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.en_US
dc.identifier.urihttp://hdl.handle.net/2104/8787
dc.licenseGPLen_US
dc.subjectSymmetry Detectionen_US
dc.subjectGeneralized Symmetry Detectionen_US
dc.titleA Universal Symmetry Detection Algorithmen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Universal Symmetry.pdf
Size:
73.71 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.87 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science Technical Reports