Designing of geometrical placement algorithms on the basis of matrix and level technologies

Abstract

 In article matrix and level technologies of designing of algorithms of the solution of tasks of geometrical placement are considered. The structure of matrix technology with examples of use for the solution of NP-difficult tasks of a geometrical covering, decomposition of the multicoherent orthogonal ground, a complex task of a geometrical covering and cutting is given. Efficiency of options matrix and level algorithm on the example of the solution of a twocriteria complex task of a geometrical covering and cutting is researched. Results of the solution of specially generated wasteless examples with single coverage ratios and cutting are given. Recommendations for the practical solution of a complex task of a geometrical covering and cutting are made.