Pages that link to "Item:Q1218333"
From MaRDI portal
The following pages link to Polytope pairs and their relationship to linear programming (Q1218333):
Displaying 17 items.
- Rigidity and the lower bound theorem. I (Q578590) (← links)
- On the complexity of d-dimensional Voronoi diagrams (Q599355) (← links)
- Gale diagrams of convex polytopes and positive spanning sets of vectors (Q797150) (← links)
- A lower bound theorem for polytope pairs (Q1079814) (← links)
- The minimum number of faces of a simple polyhedron (Q1147993) (← links)
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes (Q1161997) (← links)
- The number of faces of polytope pairs and unbounded polyhedra (Q1163744) (← links)
- Stellare Abänderungen und Schälbarkeit von Komplexen und Polytopen (Q1243902) (← links)
- Bounds on the number of vertices of perturbed polyhedra (Q1312764) (← links)
- On the complexity of computing the diameter of a polytope (Q1337144) (← links)
- How good are convex hull algorithms? (Q1356937) (← links)
- A method of Euclidean centers (Q1906945) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
- Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes (Q3868395) (← links)
- Computational results on an algorithm for finding all vertices of a polytope (Q3872190) (← links)
- The Excess Degree of a Polytope (Q4579953) (← links)
- Expected Number of Vertices of a Random Convex Polyhedron (Q4741323) (← links)
