Illustration from Scientific Research

Three geometric and manufacturing constraints that can be enforced in GraphMetaMat. For each constraint, the top and bottom row show an example of a missing and satisfied constraint, respectively. For instance, if the horizontal face of the SRV does not have any nodes, although the SRV graph is a connected sequence of nodes, self-connectivity is not satisfied. Additional constraints such as the maximum number of SRV graph nodes, V max , and the relative density, , bounds are constrained using GraphMetaMat.

DOI