A simple and efficient algorithm for determining the symmetries of polyhedra

✍ Scribed by X.Y Jiang; H Bunke

• Publisher: Elsevier Science
• Year: 1992
• Weight: 547 KB
• Volume: 54
• Category: Article
• ISSN: 1049-9652
• DOI: 10.1016/1049-9652(92)90037-x

✦ Synopsis

In this paper we present a simple and efficient algorithm for determining the rotational symmetries of polyhedral objects in o(m2) time using O(m) space, where m represents the number of edges of the object. Our algorithm is an extension of Weinberg's algorithm for determining isomorphisms of planar triply connected graphs. The symmetry information detected by our algorithm can be utilized for various purposes in artificial intelligence, robotics, assembly planning, and machine vision.