from application polytope
The POINTS of an object of type PointConfiguration encode a not necessarily convex finite point set. The difference to a parent VectorConfiguration is that the points have homogeneous coordinates, i.e. they will be normalized to have first coordinate 1 without warning.
Scalar: default: Rational
PointConfiguration::ExactCoord: A point configuration with an exact coordinate type, like Rational.
These properties are for input only. They allow redundant information.
POINTS
The points of the configuration. Multiples allowed. Alias for property VECTORS.
Matrix<Scalar,NonSymmetric>
These properties capture combinatorial information of the object. Combinatorial properties only depend on combinatorial data of the object like, e.g., the face lattice.
COCIRCUIT_EQUATIONSTells the cocircuit equations that hold for the configuration, one for each interior ridge
GRAPH
Graph of the point configuration. Two points are adjacent if they are neigbours in a edge of the CONVEX_HULL.
INTERIOR_RIDGE_SIMPLICESTells the number of codimension 1 simplices that are not on the boundary
MAX_BOUNDARY_SIMPLICESTells the full-dimensional simplices on the boundary that contain no points except for the vertices.
MAX_INTERIOR_SIMPLICESTells the full-dimensional simplices that contain no points except for the vertices.
N_MAX_BOUNDARY_SIMPLICESTells the number of MAX_BOUNDARY_SIMPLICES
N_MAX_INTERIOR_SIMPLICESTells the number of MAX_INTERIOR_SIMPLICES
SIMPLEXITY_LOWER_BOUNDA lower bound for the minimal number of simplices in a triangulation
SPLITSThe splits of the point configuration, i.e., hyperplanes cutting the configuration in two parts such that we have a regular subdivision.
Matrix<Scalar,NonSymmetric>
SPLIT_COMPATIBILITY_GRAPH
Two SPLITS are compatible if the defining hyperplanes do not intersect in the interior of the point configuration. This defines a graph.
These properties capture geometric information of the object. Geometric properties depend on geometric information of the object, like, e.g., vertices or facets.
AFFINE_HULLDual basis of the affine hull of the point configuration
Matrix<Scalar,NonSymmetric>
BARYCENTERThe center of gravity of the point configuration.
Vector<Scalar>
BOUNDEDTrue if the point configuration is bounded.
CENTEREDTrue if (1, 0, 0, …) is in the relative interior.
CONVEX
True if the POINTS are in convex position.
CONVEX_HULLPolytope<Scalar>
VERTEX_POINT_MAP
Indices of VERTICES of the CONVEX_HULL as POINTS.
FAR_POINTS
Indices of POINTS that are rays.
MULTIPLE_POINTS
Tells if multiple points exist. Alias for property MULTIPLE_VECTORS.
NON_VERTICES
POINTS that are not VERTICES of the CONVEX_HULL
N_POINTSVERTEX_POINT_MAP
Indices of VERTICES of the CONVEX_HULL as POINTS
These properties capture information of the object that is concerned with the action of permutation groups.
GROUPMATRIX_ACTIONMatrixActionOnVectors<Scalar>
POINTS_ORBITS
Alias for property VECTORS_ORBITS.
POINTS_ACTIONSYMMETRIZED_COCIRCUIT_EQUATIONSThe cocircuit equations, projected to a certain direct sum of isotypic components
REPRESENTATIVE_BOUNDARY_RIDGE_SIMPLICESOne representative for each orbit of boundary ridge simplices
REPRESENTATIVE_INTERIOR_RIDGE_SIMPLICESOne representative for each orbit of interior ridge simplices
REPRESENTATIVE_MAX_BOUNDARY_SIMPLICESOne representative for each orbit of maximal-dimensional boundary simplices
REPRESENTATIVE_MAX_INTERIOR_SIMPLICESOne representative for each orbit of maximal-dimensional interior simplices
These properties collect information about triangulations of the object and properties usually computed from such, as the volume.
POLYTOPAL_SUBDIVISIONSubdivisionOfPoints<Scalar>
REFINED_SPLITSThe splits that are coarsenings of the subdivision. If the subdivision is regular these form the unique split decomposition of the corresponding weight function.
TRIANGULATIONGeometricSimplicialComplex<Scalar>
BOUNDARYFACET_TRIANGULATIONSDOC_FIXME: Incomprehensible description! For each facet the set of simplex indices of BOUNDARY that triangulate it.
GKZ_VECTORGKZ-vector
> See Chapter 7 in Gelfand, Kapranov, and Zelevinsky:
> Discriminants, Resultants and Multidimensional Determinants, Birkhäuser 1994
? Type:
:''[[..:common#Vector |Vector]]<Scalar>''
? **''MASSIVE_GKZ_VECTOR''**
:: Calculate the massive GKZ vectors of the triangulations of a integral PointConfiguration //A//. For a definition see Chapter 11 of Gelfand, Kapranov, and Zelevinsky: Discriminants, Resultants and Multidimensional Determinants, Birkhäuser 1994.
? Type:
:''[[..:common#Vector |Vector]]<Scalar>''
? Example:
:: To calculate the massive GKZ vector of a triangulation of a point configuration. This example is from the book mentioned above (p. 369, top right example).
:: <code perl> > $A=new PointConfiguration(POINTS=>[[1,0,0],[1,1,0],[1,2,0],[1,3,0],[1,0,1],[1,1,1],[1,0,2]]);
> $A->add("TRIANGULATION", WEIGHTS=>[0,1,0,1,1,1,0]);
> print $A->TRIANGULATION->MASSIVE_GKZ_VECTOR;
1 0 3 1 0 0 4
</code>
? **''REFINED_SPLITS''**
:: The splits that are coarsenings of the current ''[[..:polytope:PointConfiguration#TRIANGULATION |TRIANGULATION]]''. If the triangulation is regular these form the unique split decomposition of the corresponding weight function.
? Type:
:''[[..:common#Set |Set]]<[[..:common#Int |Int]]>''
? **''REGULAR''**
:: Checks regularity of ''[[..:polytope:PointConfiguration#TRIANGULATION |TRIANGULATION]]''.
? Type:
:''[[..:common#Bool |Bool]]''
? **''WEIGHTS''**
:: Weight vector to construct a regular ''[[..:polytope:PointConfiguration#TRIANGULATION |TRIANGULATION]]''. Must be generic.
? Type:
:''[[..:common#Vector |Vector]]<Scalar>''
These properties are for visualization.
PIF_CYCLIC_NORMAL
VIF_CYCLIC_NORMAL of the CONVEX_HULL, but with the indices form POINTS instead of VERTICES
POINT_LABELSThese methods capture combinatorial information of the object. Combinatorial properties only depend on combinatorial data of the object like, e.g., the face lattice.
faces_of_dim(PointConfiguration p)Output the faces of a given dimension
PointConfiguration p: the input point configuration
These methods capture geometric information of the object. Geometric properties depend on geometric information of the object, like, e.g., vertices or facets.
AMBIENT_DIM()
Ambient dimension of the point configuration (without the homogenization coordinate). Similar to AMBIENT_DIM.
DIM()
Affine dimension of the point configuration. Similar to DIM.
These methods are for visualization.
VISUAL()Visualize a point configuration.
Visual::Polygons::decorations
geometric_options
VISUAL_POINTS()
Visualize the POINTS of a point configuration.
Visual::Polygons::decorations
geometric_options