Global Optimization Method to Comprise Rotation-Minimizing Euler-Rodrigues Frames of Pythagorean-Hodograph Curve

The rotation-minimizing frame is the main research object for a spatial curve. Although the mathematical description is not complicated, it is not easy to directly make an exact minimizing-rotation frame for the Euler-Rodrigues frame. The condition for the non-normalized Euler-Rodrigues frame of the Pythagorean-Hodograph curve to become the rotation-minimizing frame is given in this article, which is an ordinary differential equation with rational form, the analytical solution that does not always exist. To avoid calculating the solution of ordinary differential equations, a global optimization algorithm for the conditions is proposed, that has a weight function in the objective function. The quintic Pythagorean-Hodograph curve is analyzed concretely with the method, and its objective function and constraint conditions of optimization are clarified. The example is analyzed by using this method with different weight functions and contrasting that approach with its exact value.

• Rotation-Minimizing
• Euler-Rodrigues Frames
• Pythagorean-Hodograph Curves

1. Introduction

Pythagorean-Hodograph (PH) curve is a kind of polynomial parametric curve based on offset curve research. Its characteristic is that its rate function is also polynomial, and the arc length of curve can be calculated accurately. A polynomial parametric curve P ( t ) = [ x ( t ) , y ( t ) , z ( t ) ] is called spatial PH curve, if and only if the derivative P ′ ( t ) = [ x ′ ( t ) , y ′ ( t ) , z ′ ( t ) ] of the polynomial parametric curve satisfies the condition σ ( t ) = x ′ 2 ( t ) + y ′ 2 ( t ) + z ′ 2 ( t ) being a polynomial. The equivalent condition is that there are four polynomials u ( t ) , v ( t ) , p ( t ) , q ( t ) satisfying

{ x ′ ( t ) = u 2 ( t ) + v 2 ( t ) − p 2 ( t ) − q 2 ( t ) , y ′ ( t ) = 2 u ( t ) q ( t ) + 2 v ( t ) p ( t ) , z ′ ( t ) = 2 v ( t ) q ( t ) − 2 u ( t ) p ( t ) . (1)

The arc length of the PH curve can be computed precisely by simply calculating a polynomial. The PH curve plays an important role in CAGD, which not only offers unique computational advantages over ordinary polynomial parametric curves in CAD/CAM applications, but also retains full compatibility with standard Bézier/B-spline representations [1] .

In 1994, Farouki extended the planar PH curves to spatial PH curves and surfaces, and gave an explicit expression of developable surfaces with rational offsets [2] . At the same time, the further theoretical and applied research on PH curve was carried out in [3] [4] . Hermite interpolation and continuous analysis of PH curves have attracted much attention [5] [6] [7] [8] [9] .

An orthogonal frame ( f 1 ( t ) , f 2 ( t ) , f 3 ( t ) ) is on a given spatial curve P ( t ) , if the f 1 ( t ) is the unit tangent, and the others orthogonal unit vectors f 2 ( t ) , f 3 ( t ) span the normal plane. The derivative of the frame concerning to arc length s determines its angular velocity ω = ( ω 1 , ω 2 , ω 3 ) as follow

d f 1 d s = ω × f 1 , d f 2 d s = ω × f 2 , d f 3 d s = ω × f 3 . (2)

where ω × f i represents the vector product of both vectors. There are many ways to comprise a frame [10] . A familiar case is the Frenet frame that is formed by the tangent t , the principal normal n , and the binormal b = t × n . If there are unit orthogonal vectors u , v in the normal plane, and the frame angular velocity satisfies ω ⋅ t ≡ 0 , then the ( t , u , v ) is named as a rotation-minimizing (RM) adapted frame [11] [12] , which is also called as a Bishop frame. Another equivalent condition of RM frames is ω 1 ≡ 0 . Its physical meaning is that the frames do not rotate around the tangent direction when it moves along the curve.

The RM frames of the spatial curve are of great value in research areas of computer graphics, computer animation, motion planning, and other research fields. It is specifically used in swept surface modeling, 3D roaming and motion interpolation, and has a wide range of application value. As there is hardly a way to find an exact formulation directly to calculate the RM frames, the computation of the RM frames to a spatial curve attracts a good deal of attention. Many effective geometric algorithms have been proposed; especially, using the Euler-Rodrigues (ER) frames to construct the RM frames with orthogonal transformation is a pretty good way [11] [13] . ER frame is a special rational adaptive frame base on spatial PH curve. It is always non-singular at the inflection point. It makes it different from the adaptive method, but this kind of approach does not offer a complete solution to solve the RM frame, and the authors have raised some open questions [14] .

The perfect combination of PH curve and the RM frames can be achieved through the ER frames [15] , and this frame is raised by the quaternion polynomial. But the frame is a rational form, which increases the difficulty to calculate the geometric attributes of a spatial curve [11] [13] [14] . In this paper, based on the ER frame of spatial PH curve, we propose an optimization method to approximate the RM frame, which avoids the existence to the ER frames with the transformation, and reduces the calculation of rational polynomials.

The remainder of this paper is organized as follows: In Section 2, the conditions for the non-normalized ER frames of the PH curve to become the RM frames are given, and the optimization algorithm for the conditions is proposed. The quintic PH curve is analyzed concretely, and the objective function and constraint conditions of optimization are clarified in Section 3. Some examples are analyzed by using this method in Section 4. The 5th section is the summary of the full text.

2. Preliminary Work

2.1. Quaternion

This section briefly introduces quaternion and the construction of PH curves with the quaternion.

A spatial Pythagorean-Hodograph (PH) curve can be represented in a compact form with the quaternion. Here is a brief introduction to the concept and basic operations of the quaternion. In the four-dimensional real vector space R 4 , the space formed by the quaternions represented by the standard base { 1, i , j , k } is denoted by H , which is defined as

i 2 = j 2 = k 2 = i j k = − 1.

and derive the relation

i j = − j i = k , j k = − k j = i , k i = − i k = j .

A quaternion A in space H is written as A = α 0 + α 1 i + α 2 j + α 3 k , where α 0 , α 1 , α 2 , α 3 are the real numbers. For convenience, the quaternion is written in the form of A = ( α 0 , α ) , α 0 is called the scalar part of the quaternion, and α = α 1 i + α 2 j + α 3 k is the vector part, it is called the pure quaternion when α 0 = 0 , at this time it can be regarded as a vector in three-dimensional space, and the space it constitutes is isomorphic to R 3 . For any two quaternions A = ( α 0 , α ) , B = ( β 0 , β ) the algorithm is defined as

A ± B = ( α 0 ± β 0 , α ± β ) ,

A B = ( α 0 β 0 − α ⋅ β , α 0 β + β 0 α + α × β ) ,

here α ⋅ β represents the scalar product of vectors. Therefore, the quaternion multiplication is non-commutative, that is A B ≠ B A . The conjugate quaternion is defined as A * = ( α 0 , − α ) , and its norm is ‖ A ‖ = A A * = ∑ i = 0 3     α i 2 . A is called a unit quaternion when ‖ A ‖ = 1 , the pure unit quaternion can be regarded as a unit vector in R 3 .

Let A , B be two real quaternions in H , there define three commutative algebraic operations [16] as

A ⋆ B = 1 2 ( A i B * + B i A * ) , (3)

A ⊙ B = 1 2 ( A j B * + B j A * ) ,

A ⊗ B = 1 2 ( A k B * + B k A * ) .

there are three squares denoted by A 2 ⋆ = A i A * , A 2 ⊙ = A j A * and A 2 ⊗ = A k A * .

Now given a polynomial quaternion A ( t ) = u ( t ) + v ( t ) i + p ( t ) j + q ( t ) k , it follows from the formula (3) that as a pure quaternion P ′ ( t ) = A 2 ⋆ meets the conditions Equation (1). The PH curve P ( t ) can be obtained through integral with its initial position. This PH curve can be presented by the Bézier method, and its control vertexes are directly expressed with the quaternion [17] , the next review this method to produce the quintic PH curve.

2.2. Quintic PH Curve with Quaternion

For a quintic Bézier curve segment, it can be constructed as follows, given two points and its tangents { Q 0 , ε 0 } and { Q 5 , ε 1 } .

Choose A 0 and A 2 as formula in [9] as

A i = { ‖ ε i ‖ ε i ‖ ε i ‖ + i ‖ ε i ‖ ε i ‖ + i ‖ , ε i ≠ − i , ‖ ε i ‖ k , else , ( i = 0,2 ) ,

and A 1 is free. Let

Δ d 0 = ε 0 = 1 5 A 0 2 ⋆ , Δ d 1 = 1 5 ( A 0 ⋆ A 1 ) , Δ d 2 = 1 15 ( A 0 ⋆ A 2 + A 1 2 ⋆ ) , Δ d 3 = 1 5 ( A 1 ⋆ A 2 ) , Δ d 4 = ε 1 = 1 5 A 2 2 ⋆ .

then the vertexes of Bézier curve are these

Q i = Q 0 + ∑ j = 0 i − 1     Δ d j , i = 1,2,3 , 4,5,

the Bézier curve can be produced by the vertexes Q i ( i = 0,1, ⋯ ,5 ) , that is a spatial PH curve. The quaternions A 0 and A 2 can also be defined as others forms including the rotation angle parameters. This segment has good geometric properties, such as it having tangent ε 0 at Q 0 and ε 1 at Q 5 . Because the quaternion A 1 is free, there are some freedoms for adjusting and designing the spatial PH curve.

3. Rotation-Minimizing ER Frames

3.1. Condition of Rotation-Minimizing ER Frames

If the coefficient is quaternion A ( t ) , construct velocity vector curve P ′ ( t ) = A 2 ⋆ , and then get a Bézier curve P ( t ) through integration. It has an ER orthogonal

frame ( e 1 , e 2 , e 3 ) = 1 σ ( A 2 ⋆ , A 2 ⊙ , A 2 ⊗ ) , in which

σ ( t ) = ‖ A i A * ‖ = ‖ A j A * ‖ = ‖ A k A * ‖ . To comprise the RM frames for the ER frames, set the rotation angle as θ ( t ) , and construct the orthogonal transformation

[ e ¯ 2 ( t ) e ¯ 3 ( t ) ] = [ cos 2 θ − sin 2 θ ± sin 2 θ ± cos 2 θ ] [ e 2 ( t ) e 3 ( t ) ] . (4)

In Equations (4), there is a rotation transformation when it takes the positive signs, otherwise, it is the specular transformation. To make ( e 1 , e ¯ 2 , e ¯ 3 ) become a RM frame, it must satisfy e ¯ ′ 2 ⋅ e ¯ 3 = 0 , for details, refer to the literature [9] , and deduce the relationship (All of the derivatives are with respect to parameter t in this text unless noted otherwise)

d θ d t = 1 2 ( e ¯ ′ 2 ⋅ e ¯ 3 ) , (5)

For the convenience of calculation, when rotating the above ER frame, we do not consider the normalization of the coordinates. It is still an orthogonal frame, and directly rotate the isometric frame ( A i A * , A j A * , A k A * ) , which are not rational polynomials. At the same time, according to the above marks, it can also be recorded as ( A 2 ⋆ , A 2 ⊙ , A 2 ⊗ ) , and a similar relation can be obtained as

d θ d t = 1 2 σ 2 ( d d t A 2 ⊙ ⋅ A 2 ⊗ ) ≜ g ( t ) , (6)

A brief proof process is followed, according to equations (4), we can obtain

[ u ( t ) v ( t ) ] = [ cos 2 θ − sin 2 θ sin 2 θ cos 2 θ ] [ A 2 ⊙ A 2 ⊗ ] , (7)

thus we have

u ′ ( t ) = − 2 ( sin 2 θ A 2 ⊙ + cos 2 θ A 2 ⊗ ) d θ d t + [ cos 2 θ ( A 2 ⊙ ) ′ − sin 2 θ ( A 2 ⊗ ) ′ ]

and

v ( t ) = sin 2 θ A 2 ⊙ + cos 2 θ A 2 ⊗ ,

let’s take the scaler product of them

u ′ ( t ) ⋅ v ( t ) = 2 σ 2 d θ d t + sin 2 θ cos 2 θ [ ( A 2 ⊙ ) ′ ⋅ A 2 ⊙ − ( A 2 ⊗ ) ′ ⋅ A 2 ⊗ ]       + cos 2 2 θ ( A 2 ⊙ ) ′ ⋅ A 2 ⊗ − sin 2 2 θ ( A 2 ⊗ ) ′ ⋅ A 2 ⊙ . (8)

Here exist A 2 ⊙ ⋅ A 2 ⊙ = A 2 ⊗ ⋅ A 2 ⊗ = σ 2 . This thereby, ( A 2 ⊙ ) ′ ⋅ A 2 ⊙ = ( A 2 ⊗ ) ′ ⋅ A 2 ⊗ = σ ′ σ , and A 2 ⊙ ⋅ A 2 ⊗ = 0 , then ( A 2 ⊙ ) ′ ⋅ A 2 ⊗ + A 2 ⊙ ⋅ ( A 2 ⊗ ) ′ = 0 . These submit to the Equation (8) make it to zero, so the Equation (6) is hold.

Theoretically, setting the initial value of θ 0 (set θ 0 = 0 in subsequent examples), we can calculate θ by integrating equation (6) as follows,

θ = θ 0 + ∫ 0 t     g ( t ) d t .

But in general, the expression of θ is difficult to obtain. It is an ordinary differential problem with initial values, and we can obtain the value through discrete numerical calculation. Using the Trapezoidal integral formula, we can get the solution of discrete point sequence t 0 , t 1 , ⋯ , t m with θ ( t 0 ) = θ 0 ,

θ ( t k ) = θ ( t k − 1 ) + Δ t 2 [ g ( t k − 1 ) + g ( t k ) ] + O ( Δ t ) 3 , Δ t = t k − t k − 1 , k = 1 , 2 , ⋯ , m . (9)

Although this method can achieve approximate minimum rotation, there is a challenge for each θ to calculate the integral of a rational expression in practical application. Because of the delay in the calculation, it is very detrimental to a predictable adaptive method for the entire curve.

To build an adapted rotation-minimizing frame, the numerical calculation method cannot meet practical requirements, so we select a continuous angular function

θ = arctan ϕ ( t )

to approximate the exact solution. The corresponding rotation matrix is

[ u ( t ) v ( t ) ] = 1 1 + ϕ 2 ( t ) [ 1 − ϕ 2 ( t ) − 2 ϕ ( t ) ± 2 ϕ ( t ) ± [ 1 − ϕ 2 ( t ) ] ] [ A 2 ⊙ A 2 ⊗ ] , (10)

The angle function is often chosen as

ϕ ( t ) = a ( t ) b ( t ) ,

where a ( t ) and b ( t ) are the reduced polynomials, i.e. g c d ( a ( t ) , b ( t ) ) = 1 .

The orthogonal transformation

[ u ( t ) v ( t ) ] = [ b 2 ( t ) − a 2 ( t ) − 2 a ( t ) b ( t ) ± 2 a ( t ) b ( t ) ± [ b 2 ( t ) − a 2 ( t ) ] ] a 2 ( t ) + b 2 ( t ) [ A 2 ⊙ A 2 ⊗ ] (11)

Equations (11) are minor changes of the transformation matrix that compares with the literature [11] , which is just for the convenience of expression. The final

comprised frame ( e 1 , e u , e v ) is a RM frames, here e u = u ( t ) ‖ u ( t ) ‖ , e v = v ( t ) ‖ v ( t ) ‖ .

Polynomials a ( t ) , b ( t ) need to meet the relation (we only consider the rotation transformation here)

1 2 σ 2 ( d d t A 2 ⊙ ⋅ A 2 ⊗ ) = a b ′ − a ′ b a 2 + b 2 , (12)

In fact, for one general spatial curve, the polynomials a ( t ) and b ( t ) does not always exist, so we adopt the optimization calculation method to find the approximate RM frames.

3.2. Optimization Method of ER Frames

The optimization method is as follows,

1) Find that the polynomial a ( t ) and b ( t ) satisfies d d t A 2 ⊙ ⋅ A 2 ⊗ = a b ′ − a ′ b ,

the sufficient condition for the equation to hold is that the degree of a ( t ) and b ( t ) must be same. The degree of a ( t ) , b ( t ) selected is the same as that of the polynomial A 2 ⊙ ( t ) , so there are still 2 degrees of freedom left. Otherwise, the degree of freedom will be reduced and not even.

2) Use the above 2 freedoms to approximate and optimize the above Equation (12) as

1 = d d t A 2 ⊙ ⋅ A 2 ⊗ a b ′ − a ′ b ≈ 2 σ 2 a 2 + b 2 ,

and construct the following objective function

arg min a , b ∫ 0 1     ρ ( t ) [ a 2 ( t ) + b 2 ( t ) − 2 σ 2 ] 2 d t . (13)

where ρ ( t ) is the weight function. Generally, we can select ρ ( t ) = 1 or ρ ( t ) = σ ( t ) and so on, which can realize the optimization effect of arc length.

Although it is not an exact RM frames, it can realize the minimum rotation problem on the whole curve at one time.

4. RM Frames of Quintic PH Curve

Let A ( t ) = ( 1 − t ) 2 A 0 + 2 ( 1 − t ) t A 1 + t 2 A 2 , where A i ( i = 0,1,2 ) are three real quaternion polynomials, then

d d t ( A j A * ) = d d t A 2 ⊙ = A j A * ′ + A ′ j A * = 4 ∑ i = 0 3     B 3, i ( t ) P i , (14)

where

p 0 = A 0 ⊙ ( A 1 − A 0 ) , p 1 = 1 3 [ A 0 ⊙ ( A 2 − A 1 ) ] + 2 3 [ A 1 ⊙ ( A 1 − A 0 ) ] ,

p 2 = 1 3 [ A 2 ⊙ ( A 1 − A 0 ) ] + 2 3 [ A 1 ⊙ ( A 2 − A 1 ) ] , p 3 = A 2 ⊙ ( A 2 − A 1 ) . (15)

All of these p i ( i = 0,1 , 2,3 ) are the pure quaternions, and B n , i ( t ) = C n i ( 1 − t ) n − i t i is the Bernstein basis function, then the Equation (14) also can be presented by

d d t ( A j A * ) = ∑ i = 0 3     B ′ 4, i ( t ) r i , (16)

where

r 0 = − ( p 0 + p 1 + p 2 + p 3 ) , r 1 = − ( p 1 + p 2 + p 3 ) , r 2 = − ( p 2 + p 3 ) , r 3 = − p 3 . (17)

The following expression is parallelled deduced as above,

A k A * = A 2 ⊗ = ∑ i = 0 4     B 4, i ( t ) q i , (18)

where

q 0 = A 0 2 ⊗ , q 1 = A 0 ⊗ A 1 , q 2 = 1 3 [ A 0 ⊗ A 2 ] + 2 3 [ A 1 2 ⊗ ] , q 3 = A 1 ⊗ A 2 , q 4 = A 2 2 ⊗ . (19)

After calculating the scaler product of (16) and (18), we obtain follow equation

A 2 ⊙ ′ ⋅ A 2 ⊗ = ∑ i = 0 3     ∑ j = 0 4     B ′ 4, i ( t ) B 4, j ( t ) ( r i ⋅ q j ) . (20)

Set two polynomials to be a ( t ) = ∑ i = 0 4     a i B 4 , i ( t ) and b ( t ) = ∑ i = 0 4     b i B 4 , i ( t ) . we can deduce follow equations,

a ( t ) b ′ ( t ) = ∑ i = 0 3     ∑ j = 0 4     B ′ 4 , i ( t ) B 4 , j ( t ) ( b i − b 4 ) a j ,

and

a ′ ( t ) b ( t ) = ∑ i = 0 3     ∑ j = 0 4     B ′ 4 , i ( t ) B 4 , j ( t ) ( a i − a 4 ) b j ,

then

a ( t ) b ′ ( t ) − a ′ ( t ) b ( t ) = ∑ i = 0 3     ∑ j = 0 4     B ′ 4 , i ( t ) B 4 , j ( t ) [ ( b i − b 4 ) a j − ( a i − a 4 ) b j ] . (21)

The result of (21) is equal to the above Equations (20), there is an equation on two septic polynomials being the same, it is

∑ i = 0 3     ∑ j = 0 4     B ′ 4 , i ( t ) B 4 , j ( t ) M i j = 0. (22)

where M i j = [ ( b i − b 4 ) a j − ( a i − a 4 ) b j ] − r i ⋅ q j = det ( a 4 − a i a j b 4 − b i b j ) − r i ⋅ q j . Here we define that B n , − 1 ( t ) = 0 and C n − 1 = 0 , use the formula B ′ 4, i ( t ) = − 4 [ B 3, i ( t ) − B 3, i − 1 ( t ) ] , the equations can be rewritten as

∑ i = 0 3     ∑ j = 0 4 [ B 3 , i ( t ) − B 3 , i − 1 ( t ) ] B 4 , j ( t ) M i j = 0. (23)

Due to the coefficient of the septic polynomial being zero, we can obtain a system with 8 equations and 10 variables a i , b i ( i = 0 , 2 , 3 , 4 ) , there are

{ M 00 − M 10 = 0 , 3 M 10 + 4 M 01 − 3 M 20 − 4 M 11 = 0 , M 20 + 4 M 11 + 2 M 02 − M 30 − 4 M 21 − 2 M 12 = 0 , M 30 + 12 M 21 + 18 M 12 + 4 M 03 − 12 M 31 − 18 M 22 − 4 M 13 = 0 , 4 M 31 + 18 M 22 + 12 M 13 + M 04 − 18 M 32 − 12 M 23 − M 14 = 0 , 2 M 32 + 4 M 23 + M 14 − 4 M 33 − M 24 = 0 , 4 M 33 + 3 M 24 − 3 M 34 = 0 , M 34 = 0. (24)

The constraint Equations (24) is a system of quadratic equations with polynomial coefficients a i , b i ( i = 0 , 1 , 2 , 3 , 4 ) , which are solved by optimization method, so obtain two polynomials a ( t ) , b ( t ) . The ER frames are further rotated and transformed by the formula (10), and the next step normalizes these two components, then obtain the global rotation-minimizing (GRM) frames. Of course, this is an approximately GRM frames by optimization method, because the exact polynomials are always non-existent.

5. Examples

We use the three quaternions A 0 = ( 0,1,0,2 ) T , A 1 = ( 0,2,1, − 1 ) T , A 2 = ( 0,3, − 2, − 1 ) T in follow examples. Figure 1(a) is the original ER frame, Figure 1(b) is the GRM frames through optimization with ρ = 1 . After calculating, the two polynomials are

a ( t ) = 6.5789 B 4 , 0 ( t ) + 3.1495 B 4 , 1 ( t ) − 2.1811 B 4 , 2 ( t )                   + 15.3863 B 4 , 3 ( t ) + 17.1115 B 4 , 4 ( t ) , b ( t ) = − 0.8943 B 4 , 0 ( t ) + 1.0685 B 4 , 1 ( t ) − 0.6119 B 4 , 2 ( t )                   + 1.1118 B 4 , 3 ( t ) + 3.9292 B 4 , 4 ( t ) .

Figure 2 describes the swept surface with ER frames and RM frames with ρ = 1 , Figure 2(a) is corresponding to the ER frames, and Figure 2(b) is to the GRM frames.

Figure 3 shows the GRM frame through optimization with ρ = | τ ( t ) κ ( t ) | , in this τ ( t ) is the torsion of the curve, and κ ( t ) is the curvature. Using this optimizing method, the polynomials are

a ( t ) = 9.8125 B 4 , 0 ( t ) + 1.1353 B 4 , 1 ( t ) − 1.1893 B 4 , 2 ( t )                   + 15.1672 B 4 , 3 ( t ) + 9.1231 B 4 , 4 ( t ) , b ( t ) = − 1.4645 B 4 , 0 ( t ) + 0.8832 B 4 , 1 ( t ) − 0.4792 B 4 , 2 ( t )                   − 0.0104 B 4 , 3 ( t ) + 2.7759 B 4 , 4 ( t ) .

Figure 4 describes the exact RM frames through the ordinary differential equation numerical calculation method, Figure 4(a) is the frames, and Figure 4(b) is its swept surface.

Figure 5 describes the rotation angle changing along parameter t with different weight function. The exact value is the lower limit for each method of rotation minimizing. The rotation amount of the optimization method is greater

than the exact method, but the curve arc length is 17 3 , as an approximation

method, the effect can be acceptable. The choice of weight function may reduce the rotation amount, we usually define it as ρ = 1 .

6. Conclusions

To a spatial PH curve built by the quaternion, ER frames are natural orthogonal frames. An ordinary differential equation of the rotation angle function is deduced by differentiation. The RM frames of those ER frames can be obtained by calculating its integral. The optimization method to construct an approximate rotation-minimizing frames is proposed on it ER frames, that avoid the existence to the ER frames with the transformation of rational form, and the weight function of the optimization objective function can optimize its effect. Moreover, we try to avoid the derivation and integration of rational polynomials in the process of its implementation, to reduce the amount of calculation. In terms of experimental results, it has a good practical effect.

The effect is good when the arc length of the curve is not large, but when the arc length is large, the effect of the objective function close to zero is not very ideal. When the torsion transformation of the curve itself is very large, its effect also has a certain impact.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

1. Farouki, R.T., Giannelli, C. and Sestini, A. (2015) Identification and “Reverse Engineering” of Pythagorean-Hodograph Curves. Computer Aided Geometric Design, 34, 21-36. https://doi.org/10.1016/j.cagd.2015.04.001

2. Farouki, R.T. and Sakkalis, T. (1994) Pythagorean-Hodograph Space Curves. Advances in Computational Mathematics, 2, 41-46.https://doi.org/10.1007/BF02519035

3. Farouki, R.T. (1994) The Conformal Map Z → Z² of the Hodograph Plane. Computer Aided Geometric Design, 11, 363-390.https://doi.org/10.1016/0167-8396(94)90204-6

4. Farouki, R.T. and Shah, S. (1996) Real-Time CNC Interpolators for Pythagorean-Hodograph Curves. Computer Aided Geometric Design, 13, 583-600. https://doi.org/10.1016/0167-8396(95)00047-X

5. Farouki, R.T. and Neff, C.A. (1995) Hermite Interpolation by Pythagorean Hodograph Quintics. Mathematics of Computation, 64, 1589-1609. https://doi.org/10.1090/S0025-5718-1995-1308452-6

6. Farouki, R.T., Al-Kandari, M. and Sakkalis Neff, T. (2002) Hermite Interpolation by Rotation-Invariant Spatial Pythagorean-Hodograph Curves. Advances in Computational Mathematics, 17, 369-383. https://doi.org/10.1023/A:1016280811626

7. Pelosi, F., Farouki, R.T., Manni, C. and Sestini, A. (2005) Geometric Hermite Interpolation by Spatial Pythagorean-Hodograph Cubics. Advances in Computational Mathematics, 22, 325-352. https://doi.org/10.1007/s10444-003-2599-x

8. Kwon, S.-H. (2009) Solvability of G¹ Hermite Interpolation by Spatial Pythagorean-Hodograph Cubics and Its Selection Scheme. Computer Aided Geometric Design, 27, 138-149. https://doi.org/10.1016/j.cagd.2009.11.002

9. Marjeta, K. and Lucia, S.M. (2021) Geometric Interpolation of ER Frames with G² Pythagorean-Hodograph Curves of Degree 7. Computer Aided Geometric Design, 88, Article ID: 102001. https://doi.org/10.1016/j.cagd.2021.102001

10. Bishop R.L. (1975) There Is More than One Way to Frame a Curve. The American Mathematical Monthly, 82, 246-251. https://doi.org/10.2307/2319846

11. Farouki, R.T., Giannelli, C. and Sestini, A. (2018) Rational Minimal-Twist Motions on Curves with Rotation-Minimizing Euler-Rodrigues Frames. Journal of Computational and Applied Mathematics, 352, 240-254. https://doi.org/10.1016/j.cam.2018.12.012

12. Farouki, R.T., Giannelli, C., Manni, C. and Sestini, A. (2007) Identification of Spatial PH Quintic Hermite Interpolants with Near-Optimal Shape Measures. Computer Aided Geometric Design, 25, 274-297. https://doi.org/10.1016/j.cagd.2007.09.007

13. Farouki, R.T., Giannelli, C., Manni, C. and Sestini, A. (2009) Quintic Space Curves with Rational Rotation-Minimizing Frames. Computer Aided Geometric Design, 26, 580-592. https://doi.org/10.1016/j.cagd.2009.01.005

14. Farouki, R.T. (2016) Rational Rotation-Minimizing Frames—Recent Advances and Open Problems. Applied Mathematics and Computation, 272, 80-91. https://doi.org/10.1016/j.amc.2015.04.122

15. Farouki, R.T. (2002) Exact Rotation-Minimizing Frames for Spatial Pythagorean-Hodograph Curves. Graphical Models, 64, 382-395. https://doi.org/10.1016/S1524-0703(03)00002-X

16. Kim, S.H. and Moon, H.P. (2002) Deformation of Spatial Septic Pythagorean Hodograph Curves Using Gauss-Legendre Polygon. Computer Aided Geometric Design, 73, 16-34. https://doi.org/10.1016/j.cagd.2019.06.004

17. Wang, G.Z. and Fang, L.C. (2009) On Control Polygons of Quartic Pythagorean-Hodograph Curves. Computer Aided Geometric Design, 26, 1006-1015. https://doi.org/10.1016/j.cagd.2009.08.003