A bar-joint framework is a collection of rigid bars connected by pin-joints. A minimally rigid bar-joint framework is a rigid bar-joint framework in which removing any bar results in a graph that is not a rigid bar-joint framework. In this paper, we present algorithms for making minimally rigid bar-joint frameworks consisting of union of space-filling convex polyhedra by adding braces. Moreover, we present the generation method for making minimally rigid framework assuming the internal empty space and the openings by extending the algorithms.