A complete description of cones and polytopes including hypervolumes of all facets of a polytope
From MaRDI portal
Publication:4928893
Recommendations
Cites work
- scientific article; zbMATH DE number 1270599 (Why is no real title available?)
- A Matrix Approach to Finding a Set of Generators and Finding the Polar (Dual) of a Class of Polyhedral Cones
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
- An algorithm for determining redundant inequalities and all solutions to convex polyhedra
- An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
- An optimal convex hull algorithm in any fixed dimension
- An orthogonally based pivoting transformation of matrices and some applications
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
- How good are convex hull algorithms?
- Obtaining simultaneous solutions of linear subsystems of inequalities and duals
- The Complexity of Vertex Enumeration Methods
- Updating inverses in matrix analysis of structures
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)