Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T18:17:10.133Z Has data issue: false hasContentIssue false

Computing symmetry groups of polyhedra

Published online by Cambridge University Press:  01 October 2014

David Bremner
Affiliation:
Faculty of Computer Science, University of New Brunswick, Box 4400, Fredericton NB, E3B 5A3 Canada email bremner@unb.ca
Mathieu Dutour Sikirić
Affiliation:
Rudjer Bosković Institute, Bijenicka 54, 10000 Zagreb, Croatia email mdsikir@irb.hr
Dmitrii V. Pasechnik
Affiliation:
Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, Oxford OX1 3QD, United Kingdom email dima.pasechnik@cs.ox.ac.uk
Thomas Rehn
Affiliation:
initOS GmbH & Co. KG, Hegelstraße 28, 39104 Magdeburg, Germany email thomas.rehn@research.initos.com
Achill Schürmann
Affiliation:
Institute of Mathematics, University of Rostock, 18051 Rostock, Germany email achill.schuermann@uni-rostock.de

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial structure of a polyhedron. In each case we give algorithmic methods to compute the corresponding group and discuss some practical experiences. For practical purposes the linear symmetry group is the most important, as its computation can be directly translated into a graph automorphism problem. We indicate how to compute integral subgroups of the linear symmetry group that are used, for instance, in integer linear programming.

Information

Type
Research Article
Copyright
© The Author(s) 2014