reviewed the problem of filling of space bounded by an arbitrary parallelepiped using tetrahedrons placed according to rules of the tetrahedral model of the hexagonal close packed structures. Described flaws of the basic and the improved algorithms of this task solving. Researched and tested ways to fix this flaws. Formulated the final version of the algorithm suitable for building targeted structure models.
