ISSN:
1432-2315
Keywords:
Symmetry detection
;
Congruity problem
;
Algorithm design
;
Graph theory
;
Computational geometry
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract We propose a simple and efficient general algorithm for determining both rotational and involutional symmetries of polyhedra. It requiresO(m 2) time and usesO(m) space, wherem is the number of edges of the polyhedron. As this is the lower bound of the symmetry detection problem for the considered output form, our algorithm is optimal. We show that a slight modification of our symmetry detection algorithm can be used to solve the related conguity problem of polyhedra.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01782322