Triangulating a Nonconvex Polytope.
B. Chazelle, L. Palios (1990)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Subdivision Algorithms and the Kernel of a Polyhedron.”
Triangulating a Nonconvex Polytope.
Largest j-Simplices in n-Polytopes.
V. Klee, P. Gritzmann, D. Larman (1995)
Discrete & computational geometry
Similarity:
Toughness and Delaunay Triangulations.
M.B. Dillencourt (1990)
Discrete & computational geometry
Similarity:
Triangulating Point Sets in Space.
D. Avis, Hossam ElGindy (1987)
Discrete & computational geometry
Similarity:
A Note on Small Linear-Ordering Polytopes.
G. Reinelt (1993)
Discrete & computational geometry
Similarity:
Wv Paths on the Torus.
D.W. Barnette (1990)
Discrete & computational geometry
Similarity:
Invertible Relations on Polytopes.
G.T. Sallee (1987)
Discrete & computational geometry
Similarity:
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces.
K. Mulmuley (1993)
Discrete & computational geometry
Similarity:
Iterated Nearest Neighbors and Finding Minimal Polytopes.
D. Eppstein, J. Erickson (1994)
Discrete & computational geometry
Similarity:
Exterior Algebra and Projections of Polytopes.
P. Filliman (1990)
Discrete & computational geometry
Similarity:
The Cubical d-Polytopes with Fewer than 2d+1 Vertices.
R. Blind, G. Blind (1995)
Discrete & computational geometry
Similarity: