The paper is devoted to the algorithm for the placement of orthogonal polyhedrons represented as a set of orthogonal objects with a fixed position relative to each other. The proposed algorithm is implemented invariantly with respect to the dimension of the objects to be placed, which makes it applicable for solving the cutting and packing problems of arbitrary dimension. Examples of the placement of two-dimensional and three-dimensional orthogonal polyhedrons are presented.