scientific article; zbMATH DE number 3911182

MaRDI QIDQ3689016zbMATH OpenFDO

Authors Carl W. Lee

Publication date 1985

zbMATH Keywords

subdivisionstriangulation of convex d-polytopes

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Recommendations

• scientific article; zbMATH DE number 1182907
• On a partition of a convex polytope into simplexes without new vertices
• Minimal simplicial dissections and triangulations of convex 3-polytopes
• scientific article; zbMATH DE number 3927925
• Polytopes with few vertices and few facets

Cited in

(10)

• Triangulations of simplicial polytopes
• Some remarks on triangulating a d-cube
• Constructions and complexity of secondary polytopes
• Subdivisions from primal and dual cones and polytopes
• scientific article; zbMATH DE number 4169563 (Why is no real title available?)
• A note on the MIR closure and basic relaxations of polyhedra
• The associahedron and triangulations of the \(n\)-gon
• scientific article; zbMATH DE number 5642599 (Why is no real title available?)
• A simple and relatively efficient triangulation of the n-cube
• scientific article; zbMATH DE number 3927925 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689016)