A complete description of cones and polytopes including hypervolumes of all facets of a polytope
From MaRDI portal
Publication:4928893
DOI10.1080/00207390500285784zbMath1264.97007OpenAlexW2068313347MaRDI QIDQ4928893
F. Jubete, Enrique F. 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
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
- Unnamed Item
- 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
- How good are convex hull algorithms?
- Obtaining simultaneous solutions of linear subsystems of inequalities and duals
- An algorithm for determining redundant inequalities and all solutions to convex polyhedra
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
- An Orthogonally Based Pivoting Transformation of Matrices and Some Applications
- The Complexity of Vertex Enumeration Methods
- Updating inverses in matrix analysis of structures
- A Matrix Approach to Finding a Set of Generators and Finding the Polar (Dual) of a Class of Polyhedral Cones
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
This page was built for publication: A complete description of cones and polytopes including hypervolumes of all facets of a polytope