Largest j-Simplices in n-Polytopes.
V. Klee, P. Gritzmann, D. Larman (1995)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Toughness and Delaunay Triangulations.”
Largest j-Simplices in n-Polytopes.
Triangulating a Nonconvex Polytope.
B. Chazelle, L. Palios (1990)
Discrete & computational geometry
Similarity:
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:
Wv Paths on the Torus.
D.W. Barnette (1990)
Discrete & computational geometry
Similarity:
On Polytopes Cut by Flats.
J. Kincses (1995)
Discrete & computational geometry
Similarity:
Exterior Algebra and Projections of Polytopes.
P. Filliman (1990)
Discrete & computational geometry
Similarity:
Upper Bounds for Configurations and Polytopes in Rd
J.E. Goodman, Richard Pollack (1986)
Discrete & computational geometry
Similarity:
Iterated Nearest Neighbors and Finding Minimal Polytopes.
D. Eppstein, J. Erickson (1994)
Discrete & computational geometry
Similarity:
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces.
K. Mulmuley (1993)
Discrete & computational geometry
Similarity:
The Lower and Upper Bound Problems for Cubical Polytopes.
W. Jockusch (1993)
Discrete & computational geometry
Similarity: