Cutting And Parameterization Algorithms On Virtual Garment Mesh Models

The technique of garment CAD is an indispensable and powerful tool for the industrialized garment production, which has dramatically influenced the traditional garment industry. With the rapid development of computer technology and the urgent demand of individualized garment production, 3D garment CAD has become a hot topic and received broad attention. And it gave rise to considerable research on 3D virtual garment mesh models. One of research directions is the cutting algorithm, which has widespread application areas as diverse as flattening, freedom editing, and virtual draping of garment models. Meanwhile, the related parameterization algorithm also plays an important role in garment CAD as well, which can be applied for virtual garment processing such as texture mapping, surface fitting, and remeshing. Therefore, the study of cutting and parameterization algorithms on virtual garment mesh models is important and has practicable significance.Based on the features of virtual garment mesh models, the paper mainly studies algorithms of garment mesh cutting, boundary optimization, region searching, and stretch-minimizing parameterization. The paper is organized as below.Cheaper 1 introduces the related work on mesh cutting and parameterization algorithms of domestic and overseas research, and points out their important study significance and wide potential application.Cheaper 2 describes the set representation of 3D virtual garment mesh models, and introduces an approach for picking points on the model surface based on the needle puncturing.Cheaper 3 presents a mesh cutting algorithm using minimal edge curvature path and introduces its improved algorithm. Inspired from the algorithm of the shortest path on graph, it defines the curvature of each mesh edge and extracts feature lines as the cutting lines with SPFA. Then, it gives an improved algorithm for computing minimal average edge curvature path. The algorithm is proficient in extracting cutting lines with geometric features on virtual garment.Chapter 4 proposes a mesh cutting algorithm using the straightest path based on optimal cutting planes. After constructing an initial path by the normal-related straightest path algorithm, it iteratively computes the optimal cutting plane and obtains the final straightest path as cutting line via the intersection calculation. The algorithm is good at extracting the straightest line on virtual garment models.Cheaper 5 provides some algorithms on the boundary optimization and region searching of mesh models. By introducing edge collapse and triangle collapse algorithms based on quadric error measure, it optimizes boundaries of cutting lines according to 3 cases to remesh the triangle set. Then, it introduces the breadth-first algorithm on the basis of seed filling for searching regions formed by cutting lines.Chapter 6 puts forward an improved stretch-minimizing mesh parameterization. Firstly it calculates the measured boundary by the straightest path based on the optimal cutting plane. Then it introduces the general expression of vertex stretch in planar parameterization and constructs a new formula which can effectively reduce the parameterization stretch. The algorithm is finally applied to texture mapping on garment mesh models and realizes the garment changing effect.In the end of this paper, chapter 7 concludes the paper and points out the future work.