Dual Graph Partitioner of 2D NURBS Meshes for Parallel IGA
IgaDGP utility takes on the input
a topological description of a 2D NURBS
patch (in terms of degree, number of knot spans and multiplicity of
knots) and constructs its dual graph, in which graph vertices
correspond
to individual knot spans and graph edges represent their connectivity.
This dual graph is then subjected to
a decomposition using METIS graph partitioning library. The output
is accomplished in a textual (optionally colorified) form representing the dual
graph and its decomposition. Weights of the edges of the graph
correspond to the number of interface control points if the
edge connects vertices assigned to different partitions. The partitions
are indicated by their numbers (enclosed in parenthesis) at graph
vertices. The
decomposition is balanced in terms of the number of knot spans while
keeping the number of interface control points close to minimal.
