scientific article; zbMATH DE number 4175876

MaRDI QIDQ3200146zbMATH OpenFDO

Authors Petru Soltan, A. V. Prisakar', Victor Chepoi

Publication date 1990

zbMATH Keywords

3-dimensional polyhedrondissectionminimum number of boxes

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Recommendations

• Polygonal partitions
• scientific article; zbMATH DE number 4049401
• Partitioning and separating sets of orthogonal polygons
• scientific article; zbMATH DE number 146671
• On a partition into convex polygons
• Minimal partitions of a box into boxes
• On partitions of discrete boxes

Cited in

(6)

• Minimum \(d\)-convex partition of a multidimensional polyhedron with holes
• Partition problems in high dimensional boxes
• Partitioning orthogonal histograms into rectangular boxes
• PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS
• scientific article; zbMATH DE number 3105833 (Why is no real title available?)
• A solution to one of Knuth's permutation problems

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 Q3200146)