Gale diagrams of convex polytopes and positive spanning sets of vectors
From MaRDI portal
(Redirected from Publication:797150)
Recommendations
- A lost counterexample and a problem on illuminated polytopes
- Combinatorial properties of incompatible systems of linear inequalities and polyhedra
- Neighbourly polytopes with few vertices
- Some Applications of Affine Gale Diagrams to Polytopes with Few Vertices
- Spanned \(k\)-supporting hyperplanes of finite sets in \(\mathbb{R}^ d\)
Cites work
- scientific article; zbMATH DE number 3696001 (Why is no real title available?)
- scientific article; zbMATH DE number 3572198 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- Linear Inequalities and Related Systems. (AM-38)
- Minimal Positive 2-Spanning Sets of Vectors
- Polytope pairs and their relationship to linear programming
- Polytopes, graphs, and complexes
- Simplicial faces and sections of a convex polytope
- The number of d ‐polytopes with d +3 vertices
- The number of neighbourly d ‐polytopes with d +3 vertices
- The numbers of faces of simplicial polytopes
- Theory of Positive Linear Dependence
Cited in
(6)- Polytopes with few vertices and few facets
- A lost counterexample and a problem on illuminated polytopes
- Using orthogonally structured positive bases for constructing positive \(k\)-spanning sets with cosine measure guarantees
- Some Applications of Affine Gale Diagrams to Polytopes with Few Vertices
- Using Gale transforms in computational geometry
- A relationship between Gale transforms and Voronoi diagrams
This page was built for publication: Gale diagrams of convex polytopes and positive spanning sets of vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797150)
