Algorithm for topological correction of lists of simplexes of different dimensions for polyhedration of multicomponent systems

摘要

A new algorithm for polyhedration of quaternary and quaternary reciprocal systems is presented. The algorithm is based on checking all the links between vertices of a graph describing the composition diagram and selecting the polyhedration variants that correspond to the relations between the numbers of geometric elements of the complex undergoing polyhedration (graph vertices, links between them, and two-and three-dimensional complexes). Unlike Kraeva's algorithm based on the decomposition of the graph in terms of zero elements of the adjacency matrix (absent links between vertices), the new algorithm can control the entire polyhedration process, accelerates the search for internal diagonals in the polyhedron, and takes into account their possible competition.