Largest j-Simplices in n-Polytopes.
V. Klee, P. Gritzmann, D. Larman (1995)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Iterated Nearest Neighbors and Finding Minimal Polytopes.”
Largest j-Simplices in n-Polytopes.
A Note on Small Linear-Ordering Polytopes.
G. Reinelt (1993)
Discrete & computational geometry
Similarity:
Invertible Relations on Polytopes.
G.T. Sallee (1987)
Discrete & computational geometry
Similarity:
The Cubical d-Polytopes with Fewer than 2d+1 Vertices.
R. Blind, G. Blind (1995)
Discrete & computational geometry
Similarity:
Exterior Algebra and Projections of Polytopes.
P. Filliman (1990)
Discrete & computational geometry
Similarity:
The Lower and Upper Bound Problems for Cubical Polytopes.
W. Jockusch (1993)
Discrete & computational geometry
Similarity:
Two Poset Polytopes.
R.P. Stanley (1986)
Discrete & computational geometry
Similarity:
Upper Bounds for Configurations and Polytopes in Rd
J.E. Goodman, Richard Pollack (1986)
Discrete & computational geometry
Similarity:
On Polytopes Cut by Flats.
J. Kincses (1995)
Discrete & computational geometry
Similarity:
Flexible cross-polytopes in the Euclidean 4-space.
Stachel, Hellmuth (2000)
Journal for Geometry and Graphics
Similarity:
Incidence-Polytopes with Toroidal Cells.
A.I. Weiss (1989)
Discrete & computational geometry
Similarity:
The Mayer-Vietoris and IC Equations for Convex Polytopes.
J. Fine (1995)
Discrete & computational geometry
Similarity: