Probably you want to classify up to linear or affine automorphisms (which is almost the same). This can be translated into computing automorphisms of certain colored graphs, see Section 3.2 in the following paper: Bremner, David(3-NB-FC); Dutour Sikiric, Mathieu(CT-IRBO-SOC); Schürmann, Achill(D-MAG...
Let me add a remark: It is a global design decision that the polymake objects are only functional within their specification. This means a segfault is always possible if you do something wrong (like here). One could argue that this is inconvenient. However, math says that it is virtually impossible ...
Listing the vertex coordinates (e.g., of an associahedron) is accomplished by print associahedron(3)->VERTICES; Did you read our tutorials? Please look at http://www.polymake.org/doku.php/tutorial/coordinates . Visualizing 3-dimensional unbounded polyhedra works like for ordinary polytopes. However,...
If I may add: it's worth to try the shell version (where you would have to replace "." by "->", that is, for instance, LP->MAXIMAL_VALUE) since there you have tab-completion to tell you the properties available, even with the correct spelling.
The confusion comes from mixing two (very different) kinds of objects. Things like Polytope<Rational>, SimplicialComplex, Graph, ... are big objects which live on the Perl side with properties and rules and such. But there are also small objects which live on the C++ side, e.g., Matrix<Rational>, Ve...
Actually, -O1 is quite harsh (in terms of performance). Another option (if performance does matter) build a vanilla gcc 4.3 or 4.4 from scratch and use that one.
As it seems there is something terribly wrong with the installation at TU Berlin. Similar problems from there have been reported before. The current version 2.9.9 is extremely simple to install, even locally. You should try to get a correct installation.
