The Lower and Upper Bound Problems for Cubical Polytopes.
W. Jockusch (1993)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Lower Bounds for the Numbers of Antipodal Pairs and Strictly Antipodal Pairs of Vertices in a Convex Polytope.”
The Lower and Upper Bound Problems for Cubical Polytopes.
Upper Bounds for Configurations and Polytopes in Rd
J.E. Goodman, Richard Pollack (1986)
Discrete & computational geometry
Similarity:
Valuations and Polarity.
J. Lawrence (1988)
Discrete & computational geometry
Similarity:
On Ray Shooting in Convex Polytopes.
J. Matousek, O. Schwarzkopf (1993)
Discrete & computational geometry
Similarity:
Gaps in the Numbers of Vertices of Cubical Polytopes, I.
R. Blind, G. Blind (1994)
Discrete & computational geometry
Similarity:
The Mayer-Vietoris and IC Equations for Convex Polytopes.
J. Fine (1995)
Discrete & computational geometry
Similarity:
A purely combinatorial proof of the Hadwiger Debrunner conjecture.
Alon, N., Kleitman, D.J. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem.
K.L. Clarkson (1993)
Discrete & computational geometry
Similarity:
The Cubical d-Polytopes with Fewer than 2d+1 Vertices.
R. Blind, G. Blind (1995)
Discrete & computational geometry
Similarity:
Facet-Reducing Cuts of a Convex Polytope.
N. Prabhu (1995)
Discrete & computational geometry
Similarity:
Bounds on the Size of Tetrahedralizations.
B. Chazelle, N. Shouraboura (1995)
Discrete & computational geometry
Similarity: