Polyhedral representation conversion up to symmetries

We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of lower dimensional subproblems. These methods have been successfully used by different authors in special contexts. Moreover, we sketch an incremental method, which is a generalization of Fourier-Motzkin elimination, and we give some ideas how symmetry can be exploited using pivots.

[1]  N. Megiddo,et al.  On the ε-perturbation method for avoiding degeneracy , 1989 .

[2]  Viatcheslav Grishukhin.  Computing extreme rays of the metric cone for seven points , 1992, Eur. J. Comb..

[3]  Georges Voronoi.  Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs. , 1908 .

[4]  GARRET SWART,et al.  Finding the Convex Hull Facet by Facet , 1985, J. Algorithms.

[5]  P. Kaski,et al.  Classification Algorithms for Codes and Designs , 2005 .

[6]  Eugene M. Luks,et al.  Permutation Groups and Polynomial-Time Computation , 1996, Groups And Computation.

[7]  J. S. Leon,et al.  Permutation Group Algorithms Based on Partitions, I: Theory and Algorithms , 1991, J. Symb. Comput..

[8]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[9]  Rekha R. Thomas.  Triangulations of point configurations , 2006 .

[10]  David Bremner,et al.  Incremental Convex Hull Algorithms Are Not Output Sensitive , 1996, ISAAC.

[11]  Michel Deza,et al.  Small Cones of Oriented Semi-Metrics , 2001 .

[12]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[13]  Michel Balinski,et al.  On the graph structure of convex polyhedra in n-space , 1961 .

[14]  David Avis,et al.  On the complexity of vertex and facet enumeration for convex polytopes , 1998 .

[15]  Volker Kaibel,et al.  On the Complexity of Polytope Isomorphism Problems , 2003, Graphs Comb..

[16]  Reinhard Laue,et al.  Algorithms for group actions applied to graph generation , 1995, Groups and Computation.

[17]  Carl W. Lee,et al.  Regular Triangulations of Convex Polvtopes , 1990, Applied Geometry And Discrete Mathematics.

[18]  David Bremner,et al.  Primal—Dual Methods for Vertex and Facet Enumeration , 1998, Discret. Comput. Geom..

[19]  G. C. Shephard,et al.  Convex Polytopes , 1969, The Mathematical Gazette.

[20]  B. McKay.  nauty User ’ s Guide ( Version 2 . 4 ) , 1990 .

[21]  Mathieu Dutour Sikiric,et al.  Classification of eight dimensional perfect forms , 2006 .

[22]  Adalbert Kerber,et al.  Applied finite group actions , 1999 .

[23]  Achill Schürmann,et al.  Experimental Study of Energy-Minimizing Point Configurations on Spheres , 2009, Exp. Math..

[24]  David Avis,et al.  A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra , 1991, SCG '91.

[25]  Á. Seress.  Permutation Group Algorithms , 2003 .

[26]  Raimund Seidel,et al.  The Nature and Meaning of Perturbations in Geometric Computing , 1994, STACS.

[27]  Masanori Sato,et al.  On the Skeleton of the Metric Polytope , 2000, JCDCG.

[28]  G. Ziegler.  Lectures on Polytopes , 1994 .

[29]  Komei Fukuda,et al.  Double Description Method Revisited , 1995, Combinatorics and Computer Science.

[30]  Gerhard Reinelt,et al.  Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes , 2001, Int. J. Comput. Geom. Appl..

[31]  Gunnar Brinkmann,et al.  Isomorphism rejection in structure generation programs , 1998, Discrete Mathematical Chemistry.

[32]  Michael Joswig,et al.  polymake: a Framework for Analyzing Convex Polytopes , 2000 .

[33]  Mathieu Dutour Sikiric,et al.  A generalization of Voronoi's reduction theory and its application , 2006 .

[34]  T. H. Matheiss,et al.  A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets , 1980, Math. Oper. Res..

[35]  G. Reinelt,et al.  Combinatorial optimization and small polytopes , 1996 .

[36]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[37]  Mathieu Dutour Sikiric,et al.  Complexity and algorithms for computing Voronoi cells of lattices , 2008, Math. Comput..

[38]  Antoine Deza,et al.  A counterexample to the dominating set conjecture , 2007, Optim. Lett..

[39]  Günter M. Ziegler,et al.  Convex hulls, oracles, and homology , 2004, J. Symb. Comput..

[40]  P. Engel,et al.  Voronoï's impact on modern science , 1998 .

[41]  Jeffrey S. Leon,et al.  Partitions, refinements, and permutation group computation , 1995, Groups and Computation.

[42]  P. M. Neumann.  PERMUTATION GROUP ALGORITHMS (Cambridge Tracts in Mathematics 152) By ÁKOS SERESS: 264 pp., £47.50 (US$65.00), ISBN 0-521-66103-X (Cambridge University Press, 2003) , 2004 .

[43]  Jean Michel,et al.  Handbook of computational group theory , 2006, Math. Comput..

[44]  David P. Robbins,et al.  On the Volume of the Polytope of Doubly Stochastic Matrices , 1999, Exp. Math..

[45]  D. Avis.  A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm , 2000 .

[46]  Alexander Schrijver.  Disjoint paths, hypergraphs , 2003 .

[47]  David Avis,et al.  How good are convex hull algorithms? , 1995, SCG '95.

[48]  Frank H. Lutz,et al.  One-point suspensions and wreath products of polytopes and spheres , 2005, J. Comb. Theory, Ser. A.

[49]  Luc Devroye,et al.  Estimating the number of vertices of a polyhedron , 2000, Inf. Process. Lett..

[50]  Komei Fukuda,et al.  On the Face Lattice of the Metric Polytope , 2002, JCDCG.

[51]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[52]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[53]  Bernd Sturmfels,et al.  Classification of Six-Point Metrics , 2004, Electron. J. Comb..

[54]  Donald R. Chand,et al.  An Algorithm for Convex Polytopes , 1970, JACM.