Determination of the symmetries of polyhedra and an application to object recognition

  • X. Y. Jiang
  • H. Bunke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 553)


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. In particular, an application of symmetry analysis to object recognition will be described in some detail.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    W. W. Rouse Ball, Mathematical recreations and problems, Macmillan, London, 1892. Numerous editions.Google Scholar
  2. [2]
    C. Berge, Graphs, North-Holland, 1985.Google Scholar
  3. [3]
    B. Bhanu and C. C. Chen, CAD-based 3D Object Representation for Robot Vision, IEEE Computer 20, No. 8, 1987, 19–35.Google Scholar
  4. [4]
    R. C. Bolles and R. A. Cain, Recognising and locating partially visible objects, Int. Journal of Robotics Research 1, No. 3, 1982, 57–82.Google Scholar
  5. [5]
    P. J. Flynn and A. K. Jain, CAD-based computer vision: From CAD models to relational graphs, IEEE Trans. on Pattern Analysis and Machine Intelligence, 13, No. 2, 1991, pp. 114–132.Google Scholar
  6. [6]
    T. Glauser, E. Gmür, X. Y. Jiang and H. Bunke, Deductive generation of vision representations from CAD-models, in Proc. of 6th Scand. Conf. on Image Analysis, Oulu, Finland, 1989, pp. 645–651.Google Scholar
  7. [7]
    X. Y. Jiang and H. Bunke, Recognition of overlapping convex objects using interpretation tree search and EGI matching, in Proc. of SPIE Conf. on Applications of Digital Image Processing XII, Vol. 1153, San Diego, 1989, pp. 611–620.Google Scholar
  8. [8]
    X. Y. Jiang and H. Bunke, Recognizing 3-D objects in needle maps, in Proc. of 10th Int. Conf. on Pattern Recognition, Atlantic City, New Jersey, 1990, pp. 237–239.Google Scholar
  9. [9]
    O. Ore, Theory of graphs, American Mathematical Society, 1962.Google Scholar
  10. [10]
    R. J. Popplestone, Y. Liu and R. Weiss, A group theoretic approach to assembly planning, AI magazine, 11, No. 1, 1990, 82–97.Google Scholar
  11. [11]
    F. R. Preparata, M. I. Shamos, Computational geometry, Springer-Verlag New York Inc., 1985.Google Scholar
  12. [12]
    M. Shneier, A compact relational structure representation, in Proc. of 6th IJCAI, Tokyo, Japan, 1979, pp. 818–826.Google Scholar
  13. [13]
    R. Waltzman, Geometric problem solving by machine visualization, CS-TR-2291, Center for Automation Research, University of Maryland, 1989.Google Scholar
  14. [14]
    L. Weinberg, A simple and efficient algorithm for determining isomorphism of planar triply connected graphs, IEEE Trans. on Circuit Theory, 13, No. 2, 1966, pp. 142–148.Google Scholar
  15. [15]
    J. D. Wolter, R. A. Volz and T. C. Woo, Automatic generation of gripping positions, University of Michigan, Ann Arbor, February, 1984.Google Scholar
  16. [16]
    J. D. Wolter, T. C. Woo and R. A. Volz, Optimal algorithms for symmetry detection in two and three dimensions, The Visual Computer, 1, 1985, 37–48.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • X. Y. Jiang
    • 1
  • H. Bunke
    • 1
  1. 1.Institut für Informatik und angewandte MathematikUniversität BernBernSwitzerland

Personalised recommendations