Integral Migration And Reuse Of Shoe Pattern Curves Between Shoe Last Models

Curve design and reuse is an important part of the free curve design. Forcurve migration and reuse research, theories on the Euclidean space is moremature, but for triangular mesh surface, due to the curves on surfaces must bestrictly limited, and migration also needs to consider the curve’s scalingproblems that objectively increased the difficulty of curve design reuse. Thisarticle studies integral migration and reuse of shoe pattern curves betweenshoe last models, and through this research, results are as follows:(1) Put forward angle constraint path algorithm to solving the problemthat the Region of interest interaction selection in the process of curvemigration and reuse. The algorithm is an ongoing propagating process, whichis from the starting point to target, the calculate volume is only about theregion among two vertices, so the time complexity of the algorithm is betterthan Dijkstra shortest path method. Experimental results show that the methodis quickly and effectively. Based on this method, fast interaction selectedboundary triangular mesh Region of interest can come true.(2) Put forward a discrete geodesic algorithm of parallel transportgeodesic direction vector (PTGD) to solving the problem that discretegeodesic exact algorithm is lack of high operating efficiency. The algorithm isbased on the following two points: Firstly, the arc length parameterizationgeodesic S (S is a surface), the unit tangent vector along the curve parallelto itself, also known as self-parallel geodesic curve, and the discrete geodesicproblem can be transformed into discrete parallel transport geodesic tangentvectors; Secondly, the geodesic direction vector is determined by finding anapproximate path between two points, then subjected to a linear superpositionof rotation, where the finally obtained measured the vector. Experimentalresults show that, compared with the MMP algorithm, which not onlymaintain its same accuracy basically, but also improve the time efficiency of discrete geodesic calculation.(3) We proposed Hierarchical parametric approach, which is improvedproblem existed in discrete logarithm mapping of restriction of parameter-ization regional radius. Combined angle constraint path method and PTGDalgorithms to build reusable frameworks to migrating geodesic B-splinecurves between different triangular meshes. In the process of reuse,coordinate relationship properly among the position, shape, accuracy andefficiency properly, not only maintaines the overall similarity of style, butalso ensures that details of individual curves, and the accuracy and efficiencyof the algorithm should taken into account at the same time. That is a usefuldevelopment for free curves design on surfaces.(4) Based on the results of the study, we developed the migrationreusable modules of geodesic B-spline curves between different triangularmesh models, achieved the integral migration and reuse operation of shoespattern curves between shoe last models.