Macaulay2 » Documentation
Packages » OldPolyhedra :: OldPolyhedra
next | previous | forward | backward | up | index | toc

OldPolyhedra -- for computations with convex polyhedra, cones, and fans

Description

A rational convex Polyhedron is the intersection of finitely many affine half-spaces over QQ or equivalently, the convex hull of a finite set of vertices and rays. A rational convex polyhedral Cone is the intersection of finitely many linear half-spaces over QQ or equivalently, the positive hull of a finite set of rays. A Fan is a finite collection of cones such that for each cone all its faces are in the fan and for two cones in the fan the intersection is a face of each.

Polyhedra uses the FourierMotzkin package by Gregory G. Smith. Each polyhedron or cone is saved in both descriptions and a fan is saved as the list of its generating cones.

Here are some examples illustrating the main uses of this package.

For an introduction to polyhedra and cones, we recommend Gunter M. Ziegler's Lectures on Polytopes, Graduate Texts in Mathematics 152, Springer-Verlag, New York, 1995.

The author would like to thank Nathan Ilten for contributing several functions to the package.

Author

Certification a gold star

Version 1.0.5 of this package was accepted for publication in volume 1 of The Journal of Software for Algebra and Geometry: Macaulay2 on 2009-09-07, in the article Polyhedra: a package for computations with convex polyhedral objects (DOI: 10.2140/jsag.2009.1.11). That version can be obtained from the journal or from the Macaulay2 source code repository.

Version

This documentation describes version 1.3 of OldPolyhedra.

Source code

The source code from which this documentation is derived is in the file OldPolyhedra.m2.

Exports

  • Types
    • Cone -- the class of all rational convex polyhedral cones
    • Fan -- the class of all fans
    • PolyhedralComplex -- the class of all polyhedral complexes
    • PolyhedralObject -- the class of all polyhedral objects in Polyhedra
    • Polyhedron -- the class of all convex polyhedra
  • Functions and commands
    • addCone -- adds cones to a Fan
    • addPolyhedron -- adds Polyhedra to a PolyhedralComplex
    • affineHull -- computes the affine hull of a polyhedron
    • affineImage -- computes the affine image of a cone or polyhedron
    • affinePreimage -- computes the affine preimage of a cone or polyhedron
    • ambDim -- ambient dimension of a Polyhedron, Cone or Fan
    • areCompatible -- checks if the intersection of two cones/polyhedra is a face of each
    • bipyramid -- computes the bipyramid over a polyhedron
    • boundaryMap (missing documentation)
    • ccRefinement -- computes the coarsest common refinement of a set of rays
    • cellDecompose -- computes the regular cell decomposition
    • commonFace -- checks if the intersection is a face of both Cones or Polyhedra, or of cones with fans
    • cones -- computes all cones of a fan of a certain dimension
    • coneToPolyhedron -- converts a cone to class Polyhedron
    • contains -- checks if the first argument contains the second argument
    • convexHull -- computing the convex hull of points, rays and polyhedra
    • crossPolytope -- computes the d-dimensional crosspolytope with diameter 2s
    • cyclicPolytope -- computes the d dimensional cyclic polytope with n vertices
    • directProduct -- computes the direct product of two convex objects
    • dualCayley (missing documentation)
    • dualCayleyFace (missing documentation)
    • dualCone -- computes the dual Cone
    • dualFaceLattice -- computes the dual face lattice of a cone or polyhedron
    • ehrhart -- calculates the Ehrhart polynomial of a polytope
    • emptyPolyhedron -- generates the empty polyhedron in n-space
    • faceFan -- computes the fan generated by the cones over the faces
    • faceLattice -- computes the face lattice of a cone or polyhedron
    • faceOf (missing documentation)
    • faces -- computes all faces of a certain codimension of a Cone or Polyhedron
    • fan -- generates a Fan
    • fVector -- computes the f-vector of a Cone or Polyhedron
    • halfspaces -- computes the defining half-spaces of a Cone or a Polyhedron
    • hilbertBasis -- computes the Hilbert basis of a Cone
    • hirzebruch -- computes the fan of the r-th Hirzebruch surface
    • hypercube -- computes the d-dimensional hypercube with edge length 2*s
    • hyperplanes -- computes the defining hyperplanes of a Cone or a Polyhedron
    • imageFan -- computes the fan of the image
    • incompCones -- returns the pairs of incompatible cones
    • incompPolyhedra -- returns the pairs of incompatible polyhedra
    • inInterior -- checks if a point lies in the relative interior of a Cone/Polyhedron
    • interiorLatticePoints -- computes the lattice points in the relative interior of a polytope
    • interiorPoint -- computes a point in the relative interior of the Polyhedron
    • interiorVector -- computes a vector in the relative interior of a Cone
    • intersection -- computes the intersection of half-spaces, hyperplanes, cones, and polyhedra
    • isCompact -- checks compactness of a Polyhedron
    • isComplete -- checks completeness of a Fan or PolyhedralComplex
    • isEmpty -- checks if a Polyhedron is empty
    • isFace -- tests if the first argument is a face of the second
    • isLatticePolytope -- checks if a polyhedron is a lattice polytope
    • isPointed -- checks if a Cone or Fan is pointed
    • isPolytopal -- checks if a Fan is polytopal
    • isPure -- checks if a Fan or PolyhedralComplex is of pure dimension
    • isReflexive -- checks if a Polytope is reflexive
    • isSimplicial -- checks if a polyhedral object is simplicial
    • latticePoints -- computes the lattice points of a polytope
    • linSpace -- computes a basis of the lineality space
    • maxCones -- displays the generating Cones of a Fan
    • maxFace -- computes the face of a Polyhedron or Cone where a weight attains its maximum
    • maxPolyhedra -- displays the generating Polyhedra of a PolyhedralComplex
    • minFace -- computes the face of a Polyhedron or Cone where a weight attains its minimum
    • minkowskiSum -- computes the Minkowski sum of two convex objects
    • minkSummandCone -- computes the Cone of all Minkowski summands and the minimal decompositions
    • mixedVolume -- computes the mixed volume of a list of polytope
    • newtonPolytope -- computes the Newton polytope of a polynomial
    • normalFan -- computes the normalFan of a polyhedron
    • objectiveVector -- computes an objective vector of a face of a polyhedron
    • polar -- computes the polar of a polyhedron
    • polarFace -- computes the dual face of the polar polyhedron
    • polyhedra -- computes all polyhedra of a polyhedral complex of a certain dimension
    • polyhedralComplex -- generates a PolyhedralComplex
    • polytope -- returns a polytope of which the fan is the normal fan if it is polytopal
    • posHull -- computes the positive hull of rays, cones, and the cone over a polyhedron
    • posOrthant -- generates the positive orthant in n-space
    • proximum -- computes the proximum of the Polyhedron/Cone to a point in euclidian metric
    • pyramid -- computes the pyramid over a polyhedron
    • rays -- displays all rays of a Cone, a Fan, or a Polyhedron
    • saveSession -- save the actual Polyhedra session to a file
    • secondaryPolytope -- computes the secondary polytope of a compact polyhedron
    • skeleton -- computes the k-skeleton of a Fan or PolyhedralComplex
    • smallestFace -- determines the smallest face of the Cone/Polyhedron containing a point
    • smoothSubfan -- computes the subfan of all smooth cones
    • statePolytope -- computes the state polytope of a homogeneous ideal
    • stdSimplex -- generates the d-dimensional standard simplex
    • stellarSubdivision -- computes the stellar subdivision of the fan by a ray
    • sublatticeBasis -- computes a basis for the sublattice generated by integral vectors or the lattice points of a polytope
    • tailCone -- computes the tail/recession cone of a polyhedron
    • toSublattice -- calculates the preimage of a polytope in the sublattice generated by its lattice points
    • triangulate -- computes a triangulation of a polytope
    • vertexEdgeMatrix -- computes the vertex-edge-relations matrix
    • vertexFacetMatrix -- computes the vertex-facet-relations matrix
    • vertices -- displays the vertices of a Polyhedron or a PolyhedralComplex
    • volume -- computes the volume of a polytope
  • Methods
    • intersection(List) -- see intersection -- computes the intersection of half-spaces, hyperplanes, cones, and polyhedra
    • intersection(Matrix) -- see intersection -- computes the intersection of half-spaces, hyperplanes, cones, and polyhedra
    • intersection(Matrix,Matrix) -- see intersection -- computes the intersection of half-spaces, hyperplanes, cones, and polyhedra
    • intersection(Matrix,Matrix,Matrix,Matrix) -- see intersection -- computes the intersection of half-spaces, hyperplanes, cones, and polyhedra

For the programmer

The object OldPolyhedra is a package.