Largest j-Simplices in n-Polytopes.
V. Klee, P. Gritzmann, D. Larman (1995)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Triangulating a Nonconvex Polytope.”
Largest j-Simplices in n-Polytopes.
Facet-Reducing Cuts of a Convex Polytope.
N. Prabhu (1995)
Discrete & computational geometry
Similarity:
Subdivision Algorithms and the Kernel of a Polyhedron.
R. Erdahl (1992)
Discrete & computational geometry
Similarity:
Toughness and Delaunay Triangulations.
M.B. Dillencourt (1990)
Discrete & computational geometry
Similarity:
Invertible Relations on Polytopes.
G.T. Sallee (1987)
Discrete & computational geometry
Similarity:
A Note on Small Linear-Ordering Polytopes.
G. Reinelt (1993)
Discrete & computational geometry
Similarity:
Exterior Algebra and Projections of Polytopes.
P. Filliman (1990)
Discrete & computational geometry
Similarity:
On Polytopes Cut by Flats.
J. Kincses (1995)
Discrete & computational geometry
Similarity:
The Cubical d-Polytopes with Fewer than 2d+1 Vertices.
R. Blind, G. Blind (1995)
Discrete & computational geometry
Similarity:
Gaps in the Numbers of Vertices of Cubical Polytopes, I.
R. Blind, G. Blind (1994)
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: