This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision |
| tutorial:pcom [2011/05/05 10:30] – kulas | user_guide:tutorials:pcom [2019/02/04 22:55] (current) – external edit 127.0.0.1 |
|---|
| Polyhedral complexes are contained in the application ''fan''. There are two ways to define polyhedral complexes in ''polymake''. First, a polyhedral complex can be defined by an array of input points and, firstly, by a list of polytopes or, secondly, by a list of cells. In both cases the indices refer to the given points. The distinction between them is done due to the definition of [[regular_subdivisions|regular subdivisions]], where a point projected back to the subdivision may be an inner point of a cell and not a vertex of it. In both cases the indices refer to the given points. | {{page>.:latest:@FILEID@}} |
| | |
| <code> | |
| fan > $pc1 = new PolyhedralComplex(POINTS=>[[1,0,0],[1,0,1],[1,1,0],[1,1,1]],INPUT_POLYTOPES=>[[0,1,2],[2,3],[1]]); | |
| fan > $pc2 = new PolyhedralComplex(POINTS=>[[1,0],[1,1],[1,2]], MAXIMAL_CELLS=>[[0,2],[0,1,2]]); | |
| </code> | |
| | |
| Since some of the input polytopes may be redundant, you should ask for the ''MAXIMAL_POLYTOPES''. | |
| | |
| <code> | |
| fan > print $pc->MAXIMAL_POLYTOPES; | |
| </code> | |
| |