• Fashion & Textile Research Journal
• /
• v.17 no.6
• /
• pp.988-995
• /
• 2015

Gaps between the upper edges of brassiere mold cups and the breasts are one of the most serious issues in realizing comfort wearing of commercial brassieres for small-breasted women. The surplus ease amounts causing the fit problem were measured from 3D wearing images of the small-breasted women's brassieres. The effect after the removing the surplus ease amounts from the upper edge of mold cup was approved by subjective wearing evaluation. Since the volume distribution of mold cup can also affect the wearing sensation of brassiere, the subjective wearing sensation was compared for two brassieres of different volume distributions, V_L, of which volume was concentrated at the lower cup, and V_C, which has the thickest part at the nipple. As the results, the suitable sensation for cup volume and the natural wearing silhouette could be accomplished by removing the surplus ease amounts from the upper edge of mold cup to reduce the gaps between brassieres and the breasts, which could be accomplished through an approach reducing the volume near the upper edge of mold brassiere cup and making the volume concentrated at the lower cup. These works provide a useful information on the design of the brassiere mold cups for small-breasted women. Moreover, modeling methods of 3D scan data and 3D printing technique for making more accurate mold cases used in this research can be helpful to develop and evaluate clothing products in future.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.4
• /
• pp.89-97
• /
• 2024

The problem of the spokes puzzle(SP), which connects the spokes(edges) required by the wheel axis (hub, vertex) without intersection to form a network in which all the hubs are connected, can be said to be a wasteland of research. For this problem, there is no algorithm that presents a brute-force search or branch-and-bound method that takes exponential time. This paper proposes an algorithm to plot a lattice graph with cross-diagonal lines of m×n for a given SP and to pruning(delete) the surplus edges(spokes). The proposed algorithm is a simple way to select an edge of a hub whose number of edges matches the hub requirement and delete the edge crossing it. If there is no hub with an edge that meets the hub requirement, a strategy was adopted to preferentially delete(pruning) the edge of the hub with the maximum amount of spare. As a result of applying the proposed algorithm to 20 benchmarking experimental data, it was shown that a solution that minimizes the number of trials and errors can be obtained for all problems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.4
• /
• pp.99-106
• /
• 2024

The problem of the bridges(Hasjiwokakero, Hasi) puzzle, which connects the bridge(edge) required by the island(vertex) without crossing the horizontal and vertical straight bridges except for the diagonal to form a connected network, is a barren ground for research without any related research. For this problem, there is no algorithm that presents a generalized exponential time brute-force or branch-and-bound method. This paper obtained the initial solution of the lattice graph by drawing a grid without diagonal lines for a given BP, removing unnecessary edges, and supplementing essential bridges. Next, through insufficient island pair path matching, the method of adding insufficient edges to the route and deleting the crossed surplus edges(bridges) was adopted. Applying the proposed algorithm to 24 benchmarking experimental data showed that accurate solutions can be obtained for all problems.