scientific article; zbMATH DE number 20626

MaRDI QIDQ3979861zbMATH OpenFDO

Authors A. K. Pulatov, Nagiza F. Samatova

Publication date 26 June 1992

zbMATH Keywords

complexitypolyhedronrepresentation

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Resolvable representation of polyhedra
• scientific article; zbMATH DE number 175667
• Representing polyhedra: Faces are better than vertices
• The Union of Convex Polyhedra in Three Dimensions
• Combinatorial face enumeration in convex polytopes

Cited in

(6)

• Resolvable representation of polyhedra
• Representing polyhedra: Faces are better than vertices
• The representation of polyhedra by polynomial inequalities
• Complexity yardsticks for \(f\)-vectors of polytopes and spheres
• scientific article; zbMATH DE number 647646 (Why is no real title available?)
• scientific article; zbMATH DE number 701095 (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 Q3979861)