A complete description of cones and polytopes including hypervolumes of all facets of a polytope

DOI10.1080/00207390500285784zbMATH Open1264.97007OpenAlexW2068313347MaRDI QIDQ4928893FDOQ4928893

Authors: Francisco Jubete, Enrique Castillo 

Publication date: 19 June 2013

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207390500285784

Recommendations

• Polytope Volume Computation
• scientific article; zbMATH DE number 1538124
• An Efficient Algorithm for Obtaining the Volume of a Special Kind of Pyramid and Application to Convex Polyhedra
• (Deterministic) algorithms that compute the volume of polytopes
• Computing Volumes of Polyhedra

zbMATH Keywords

hypervolumeconespolytopes\(\Gamma\)-algorithmdual of a conefacets of a polytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedra and polytopes; regular figures, division of spaces (51M20) Analytic geometry, vector algebra (educational aspects) (97G70)

Cites Work

• An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• An optimal convex hull algorithm in any fixed dimension
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
• Obtaining simultaneous solutions of linear subsystems of inequalities and duals
• How good are convex hull algorithms?
• Updating inverses in matrix analysis of structures
• An orthogonally based pivoting transformation of matrices and some applications
• The Complexity of Vertex Enumeration Methods
• Title not available (Why is that?)
• A Matrix Approach to Finding a Set of Generators and Finding the Polar (Dual) of a Class of Polyhedral Cones
• An algorithm for determining redundant inequalities and all solutions to convex polyhedra

This page was built for publication: A complete description of cones and polytopes including hypervolumes of all facets of a polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928893)