We introduce a new practical and more general definition of local symmetry-preserving operations on polyhedra. These can be applied to arbitrary embedded graphs and result in embedded graphs with the same or higher symmetry. With some additional properties we can restrict the connectivity, e.g. when we only want to consider polyhedra. Using some base structures and a list of 10 extensions, we can generate all possible local symmetry-preserving operations isomorph-free
AbstractMany complex structures may be generated from simple modules with the aid of an algorithm or...
The NP-hard problem of finding symmetries in an abstract graph plays an important role in automatic ...
A fast algorithm is established to transform points of the unit sphere into fundamental region symme...
A recently developed theory of flag-graphs and $k$-orbit maps classifies maps according to their sym...
A recently developed theory of flag-graphs and $k$-orbit maps classifies maps according to their sym...
Exact algorithms for detecting all rotational and involutional symmetries in point sets, polygons an...
This paper introduces the idea of a maniplex, a common generalization of map and of polytope. The pa...
This thesis investigates the general problem of constructing meaningful drawings of abstract graphs,...
The history of graphs goes back to the work of Eulerin his discovery of the equation f – e + v = ...
ABSTRACT. Knowing the symmetries of a polyhedron can be very useful for the analysis of its structur...
A symmetry in a Constraint Satisfaction Problem (CSP) is a bijective function that preserves CSP str...
Figure 1: Polyhedral patterns on a knot. Top: three polyhedral patterns tiling a knot and optimized ...
. We give a short introduction to an heuristic to find automorphisms in a graph such as axial, centr...
Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this rea...
"Symmetry is a complexity-reducing concept [...]; seek it every-where." - Alan J. Perlis Many natura...
AbstractMany complex structures may be generated from simple modules with the aid of an algorithm or...
The NP-hard problem of finding symmetries in an abstract graph plays an important role in automatic ...
A fast algorithm is established to transform points of the unit sphere into fundamental region symme...
A recently developed theory of flag-graphs and $k$-orbit maps classifies maps according to their sym...
A recently developed theory of flag-graphs and $k$-orbit maps classifies maps according to their sym...
Exact algorithms for detecting all rotational and involutional symmetries in point sets, polygons an...
This paper introduces the idea of a maniplex, a common generalization of map and of polytope. The pa...
This thesis investigates the general problem of constructing meaningful drawings of abstract graphs,...
The history of graphs goes back to the work of Eulerin his discovery of the equation f – e + v = ...
ABSTRACT. Knowing the symmetries of a polyhedron can be very useful for the analysis of its structur...
A symmetry in a Constraint Satisfaction Problem (CSP) is a bijective function that preserves CSP str...
Figure 1: Polyhedral patterns on a knot. Top: three polyhedral patterns tiling a knot and optimized ...
. We give a short introduction to an heuristic to find automorphisms in a graph such as axial, centr...
Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this rea...
"Symmetry is a complexity-reducing concept [...]; seek it every-where." - Alan J. Perlis Many natura...
AbstractMany complex structures may be generated from simple modules with the aid of an algorithm or...
The NP-hard problem of finding symmetries in an abstract graph plays an important role in automatic ...
A fast algorithm is established to transform points of the unit sphere into fundamental region symme...