Gale diagrams of convex polytopes and positive spanning sets of vectors

DOI10.1016/0166-218X(84)90090-8zbMath0545.52006MaRDI QIDQ797150

Daniel A. Marcus

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Gale diagrampositive k-spanning setunneighbourly polytope

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37)

Related Items

Polytopes with few vertices and few facets ⋮ Using orthogonally structured positive bases for constructing positive \(k\)-spanning sets with cosine measure guarantees ⋮ A relationship between Gale transforms and Voronoi diagrams ⋮ Using Gale transforms in computational geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polytope pairs and their relationship to linear programming
• The numbers of faces of simplicial polytopes
• Linear Inequalities and Related Systems. (AM-38)
• Minimal Positive 2-Spanning Sets of Vectors
• Simplicial faces and sections of a convex polytope
• The number of neighbourly d ‐polytopes with d +3 vertices
• Polytopes, graphs, and complexes
• The number of d ‐polytopes with d +3 vertices
• Theory of Positive Linear Dependence