Qudarangulation of Sewing Pattern based on Recursive Geometry Decomposition

Abstract

The accuracy of the finite element solution is dependent on the element mesh layout and the cost of the analysis becomes prohibitively expensive if the number of elements in the mesh is too large. And a good mesh generating method should let the user to generate a mesh that is just fine enough to give an adequate solution accuracy. Hence, the computational cost of clothing simulation and rendering is mainly dependent on the type of the mesh and its quality. As a result, quadrilateral meshes are generally preferred over triangular mesh for reasons of accuracy and efficiency. This paper presented a method of quadrangulating the sewing pattern based on the recursive geometry decomposition method. Hence, the author proposed two modification on the previous algorithms. The first one deals with the recursive geometry decomposition algorithm. In the proposed algorithm the physical domain of the sewing pattern is decomposed into simple and mappable regions. And the second proposed algorithm of this work deals with the validation of vertex classification algorithm. Therefore, any invalid vertex classification can be validated using the proposed algorithm.