Gale diagrams of convex polytopes and positive spanning sets of vectors
From MaRDI portal
Publication:797150
DOI10.1016/0166-218X(84)90090-8zbMATH Open0545.52006MaRDI QIDQ797150FDOQ797150
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
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
- Linear Inequalities and Related Systems. (AM-38)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of Positive Linear Dependence
- Minimal Positive 2-Spanning Sets of Vectors
- The numbers of faces of simplicial polytopes
- Title not available (Why is that?)
- Polytope pairs and their relationship to linear programming
- Polytopes, graphs, and complexes
- Simplicial faces and sections of a convex polytope
- Title not available (Why is that?)
- The number of neighbourly d ‐polytopes with d +3 vertices
- The number of d ‐polytopes with d +3 vertices
Cited In (5)
- Polytopes with few vertices and few facets
- 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)
