Method and device for solving blade profile contour line

Abstract

The invention discloses a blade profile contour line solving method and device, and the method comprises the steps: obtaining a sphere center point cloud data set of a blade, and the sphere center point cloud data set comprises a plurality of sphere center point cloud data; dimension reduction processing is carried out on all the sphere center point cloud data, two-dimensional section circle data corresponding to all the sphere center point cloud data are obtained, and the two-dimensional section circle data correspond to two-dimensional section circles; respectively intercepting the plurality of two-dimensional section circles to obtain a plurality of sections of contour arcs; and sequentially connecting the multiple sections of contour arcs to obtain a blade profile contour line. On the basis, the three-dimensional point cloud is processed to obtain the blade profile contour line, so that the problem of information loss caused by image gray mapping in conventional image scanning is avoided, and the accuracy of blade profile contour recognition is improved.

Description

Technical Field

[0001] The present application belongs to the field of aero-engine detection technology, and in particular relates to a method and device for calculating blade profile lines. Background Art

[0002] Aircraft engine blades are precision components crucial to their reliability. Consequently, blade machining accuracy is extremely demanding. Blade profiles are governed by a series of blade profiles (cross-sections), which are often free-form curves with numerous cross-sectional characteristic parameters and geometric tolerance requirements. Furthermore, there is no fixed pattern for these profile parameters.

[0003] Currently, blade detection is usually performed by scanning the blade and determining the blade contour based on the pixels of the scanned image. For example, in the patent with publication number CN117315289B, a method for detecting the contour edge of an aircraft engine blade based on image processing is disclosed, including: performing edge detection on the image through an edge detection algorithm to determine the target edge area on the edge; clustering the pixels according to the gradient amplitude and grayscale value of the pixels in the target edge area to obtain target clusters, and then marking the pixels in the target clusters; sliding the marked pixels through a preset sliding window, and determining the segmentation threshold in each sliding window according to the grayscale change of the pixels in the preset sliding window during the sliding process; segmenting the pixels in the target edge area according to the segmentation threshold to obtain edge pixels; obtaining the minimum circumscribed rectangle of the engine blade, and calculating the flatness of the engine blade edge according to the corresponding relationship between the minimum circumscribed rectangles of the engine blade edge; and detecting the contour edge according to the flatness of the engine blade edge.

[0004] Although this method determines the blade edge contour by analyzing the scanned image, in actual application, due to the influence of the image scanning environment and image quality, there will be certain errors in the subsequent image processing, resulting in inaccurate recognition of the blade edge contour. For precision components such as blades, inaccurate blade edge contour recognition will undoubtedly pose a serious threat to engine safety. Summary of the Invention

[0005] The embodiments of the present application provide a method and device for solving blade profile contour lines, thereby improving the accuracy of blade profile scanning.

[0006] According to a first aspect of the present application, an embodiment of the present application provides a method for solving a blade profile line, which may include:

[0007] Acquire a spherical center point cloud data set of a blade, where the spherical center point cloud data set includes a plurality of spherical center point cloud data;

[0008] Perform dimensionality reduction processing on each sphere center point cloud data to obtain the two-dimensional cross-sectional circle data corresponding to each sphere center point cloud data, and the two-dimensional cross-sectional circle data corresponds to the two-dimensional cross-sectional circle;

[0009] Multiple two-dimensional cross-sectional circles are intercepted respectively to obtain multiple contour arcs;

[0010] Connect multiple contour arcs in sequence to obtain the blade contour line.

[0011] Optionally, multiple two-dimensional cross-sectional circles are intercepted respectively to obtain multiple contour arcs, including:

[0012] Selecting each two-dimensional cross-sectional circle from the plurality of two-dimensional cross-sectional circles in sequence as a first target two-dimensional cross-sectional circle;

[0013] For each first target two-dimensional cross-sectional circle, perform the following steps AC respectively to obtain the contour arc corresponding to each first target two-dimensional cross-sectional circle;

[0014] Step A: determining a plurality of intersecting circles intersecting with the first target two-dimensional cross-sectional circle based on the first target two-dimensional cross-sectional circle data of the first target two-dimensional cross-sectional circle and the two-dimensional cross-sectional circle data of the plurality of two-dimensional cross-sectional circles;

[0015] Step B: determining the union angle domain of the first target two-dimensional cross-sectional circle according to the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data of each intersecting circle;

[0016] Step C: When the union angle domain of the first target two-dimensional cross-sectional circle is not equal to the full angle domain of the first target two-dimensional cross-sectional circle, determine the arc of the first target two-dimensional cross-sectional circle corresponding to the union angle domain as the contour arc of the first target two-dimensional cross-sectional circle.

[0017] Optionally, determining the union angle domain of the first target two-dimensional cross-sectional circle according to the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data of each intersecting circle includes:

[0018] For each intersecting circle, perform the following steps DE respectively;

[0019] Step D: calculating the first intersection point coordinates and the second intersection point coordinates of the first target two-dimensional cross-sectional circle and the intersecting circle based on the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data of the intersecting circle;

[0020] Step E: Calculating the intersection angle domain between the first target two-dimensional cross-section circle and the intersection circle according to the coordinates of the first intersection point and the coordinates of the second intersection point;

[0021] The intersection angle domain of the first target two-dimensional cross-section circle and each intersection circle is merged respectively to obtain the union angle domain of the first target cross-section circle.

[0022] Optionally, intercepting multiple two-dimensional cross-sectional circles respectively to obtain multiple contour arcs includes:

[0023] Determine two preset center points with the farthest center distance from each other from a plurality of two-dimensional cross-sectional circles;

[0024] Determine the midpoint of the line connecting the two preset circle centers as the leaf chord center point;

[0025] Multiple contour arcs are obtained by cutting out multiple two-dimensional cross-sectional circles according to the center point of the leaf chord.

[0026] Optionally, determining two preset center points with the farthest center distance from each other from a plurality of two-dimensional cross-sectional circles includes:

[0027] The blade chord direction is determined by analyzing multiple two-dimensional cross-sectional circle data using a linear dimensionality reduction algorithm;

[0028] The two center points with the farthest projection distance in the blade chord direction are determined from the multiple two-dimensional cross-sectional circle data as the preset center points.

[0029] Optionally, obtaining multiple contour arcs from multiple two-dimensional cross-sectional circles according to the center point of the blade chord includes:

[0030] Selecting a second target two-dimensional cross-sectional circle from a plurality of two-dimensional cross-sectional circles according to the center point of the blade chord;

[0031] Solving the second target two-dimensional cross-sectional circle by an external arc algorithm to obtain a second target contour arc of the second target two-dimensional cross-sectional circle;

[0032] A plurality of contour arcs are determined in sequence according to the starting and ending points of the second target contour arc.

[0033] Optionally, selecting a second target two-dimensional cross-sectional circle from a plurality of two-dimensional cross-sectional circles according to the center point of the blade chord includes:

[0034] According to the two-dimensional cross-sectional circle data of each two-dimensional cross-sectional circle, the actual distance between the center point of each two-dimensional cross-sectional circle and the center point of the blade chord is calculated respectively;

[0035] Determine the difference between the radius of each two-dimensional cross-sectional circle and the corresponding actual distance;

[0036] The two-dimensional cross-sectional circle corresponding to the minimum difference value among the multiple difference values ​​is determined as the second target two-dimensional cross-sectional circle.

[0037] According to a second aspect of the present application, a device for calculating an airfoil profile is provided, which may include:

[0038] An acquisition module is used to acquire a spherical center point cloud data set of a blade, where the spherical center point cloud data set includes a plurality of spherical center point cloud data;

[0039] A dimensionality reduction module is used to perform dimensionality reduction processing on each sphere center point cloud data to obtain the two-dimensional cross-sectional circle data corresponding to each sphere center point cloud data, and the two-dimensional cross-sectional circle data corresponds to the two-dimensional cross-sectional circle;

[0040] The interception module is used to intercept multiple two-dimensional cross-section circles respectively to obtain multiple contour arcs;

[0041] The connection module is used to connect multiple contour arcs in sequence to obtain the blade contour line.

[0042] Optionally, the interception module includes:

[0043] A recurrent unit is configured to iterate the following steps CE for P times to obtain a target feature extractor, a target fault classifier, and a target domain discriminator, where P is a positive integer;

[0044] A first selection unit is used to sequentially select each two-dimensional cross-sectional circle from a plurality of two-dimensional cross-sectional circles as a first target two-dimensional cross-sectional circle;

[0045] The first interception unit is configured to execute the following steps AC for each first target two-dimensional cross-sectional circle, respectively, to obtain a contour arc corresponding to each first target two-dimensional cross-sectional circle;

[0046] Step A: determining a plurality of intersecting circles intersecting with the first target two-dimensional cross-sectional circle based on the first target two-dimensional cross-sectional circle data of the first target two-dimensional cross-sectional circle and the two-dimensional cross-sectional circle data of the plurality of two-dimensional cross-sectional circles;

[0047] Step B: determining the union angle domain of the first target two-dimensional cross-sectional circle according to the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data of each intersecting circle;

[0048] Step C: When the union angle domain of the first target two-dimensional cross-sectional circle is not equal to the full angle domain of the first target two-dimensional cross-sectional circle, determine the arc of the first target two-dimensional cross-sectional circle corresponding to the union angle domain as the contour arc of the first target two-dimensional cross-sectional circle.

[0049] Optionally, the interception module includes:

[0050] A first determining unit is used to determine two preset center points with the farthest distance between their centers from a plurality of two-dimensional cross-sectional circles;

[0051] The second determining unit is used to determine the midpoint of the line connecting the centers of the two preset circle centers as the leaf chord center point;

[0052] The second interception unit is used to intercept multiple contour arcs from multiple two-dimensional cross-sectional circles according to the center point of the blade chord.

[0053] The technical solutions provided by the embodiments of this application bring at least the following beneficial effects:

[0054] An embodiment of the present application provides a method and device for solving a blade profile contour line, which obtains a three-dimensional spherical center point cloud data set related to the blade through scanning, and then performs dimensionality reduction processing on each spherical center point cloud data set to obtain a two-dimensional cross-sectional circle on a two-dimensional plane. As a result, segments of contour arcs that can represent the blade profile can be intercepted from the two-dimensional cross-sectional circle, and then the contour arcs of each segment are connected end to end to obtain the entire blade profile contour line, thereby realizing the processing of the three-dimensional point cloud to obtain the blade profile contour line, thereby avoiding the problem of information loss caused by image grayscale mapping in conventional image scanning, and improving the accuracy of blade profile recognition.

[0055] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] The drawings herein are incorporated into and constitute a part of the specification, illustrate embodiments consistent with the present application, and together with the specification are used to explain the principles of the present application, and do not constitute an improper limitation on the present application.

[0057] Figure 1 is a flow chart showing a method for solving a blade profile line according to an exemplary embodiment;

[0058] Figure 2 1 is a schematic structural diagram of a device for calculating blade profile lines according to an exemplary embodiment;

[0059] Figure 3 The figure is a structural block diagram of a device for solving blade profile lines according to an exemplary embodiment. DETAILED DESCRIPTION

[0060] In order to more clearly understand the above-mentioned objectives, features and advantages of the present disclosure, the scheme of the present disclosure will be further described below. It should be noted that, in the absence of conflict, the embodiments of the present disclosure and the features therein can be combined with each other.

[0061] In the following description, many specific details are set forth to facilitate a full understanding of the present disclosure, but the present disclosure may also be implemented in other ways different from those described herein; it is obvious that the embodiments in the specification are only part of the embodiments of the present disclosure, rather than all of the embodiments.

[0062] As described in the background technology, the blade edge contour is determined by analyzing the scanned image. However, in actual applications, due to the influence of the image scanning environment and image quality, there will be certain errors in the subsequent image processing, resulting in inaccurate recognition of the blade edge contour. For precision components such as blades, inaccurate recognition of the blade edge contour will undoubtedly pose a serious threat to the safety of the engine.

[0063] Based on this, the present application provides a method and device for solving a blade profile contour line. The following first introduces the method for solving a blade profile contour line provided in an embodiment of the present application.

[0064] like Figure 1 - Figure 3 As shown;

[0065] Example 1;

[0066] It may include the following steps:

[0067] S101, obtaining a spherical center point cloud data set of a blade, where the spherical center point cloud data set includes a plurality of spherical center point cloud data;

[0068] S102, performing dimensionality reduction processing on each sphere center point cloud data to obtain two-dimensional cross-sectional circle data corresponding to each sphere center point cloud data, wherein the two-dimensional cross-sectional circle data corresponds to the two-dimensional cross-sectional circle;

[0069] S103, intercepting the multiple two-dimensional cross-section circles respectively to obtain multiple contour arcs;

[0070] S104, sequentially connecting multiple contour arcs to obtain a blade profile.

[0071] Based on the above embodiment, a three-dimensional spherical center point cloud data set related to the blade is obtained by scanning, and then each spherical center point cloud data is subjected to dimensionality reduction processing to obtain a two-dimensional cross-sectional circle on a two-dimensional plane. As a result, segments of contour arcs that can represent the blade profile can be intercepted from the two-dimensional cross-sectional circle, and then the contour arcs of each segment are connected end to end to obtain the entire blade profile contour line, thereby realizing the processing of the three-dimensional point cloud to obtain the blade profile contour line, thereby avoiding the problem of information loss caused by image grayscale mapping in conventional image scanning, and improving the accuracy of blade profile recognition.

[0072] The S101 is a high-precision 3D measurement device based on five-axis motion control, primarily used for geometric dimension inspection and topography analysis of complex curved workpieces. Its core feature is the coordinated motion of five axes (three linear axes X / Y / Z and two rotary axes A / C or B / C) to achieve flexible positioning of the probe at multiple angles in space, effectively completing complex structure measurements that are difficult to achieve with traditional CMMs.

[0073] The blade is placed in a five-axis measuring machine, which scans the blade to obtain multiple measurement data about the blade surface. By communicating with the five-axis measuring machine, multiple measurement data of the blade can be obtained from the five-axis measuring machine. However, the measurement data also includes a lot of information related to the measurement equipment and time. Therefore, further extraction is required from the measurement data to obtain the center point cloud data. Multiple center point cloud data can form a center point cloud dataset.

[0074] Optionally, the measurement data may include: blade workpiece number, measurement equipment number, measurement date, measurement environment, measurement coordinate system and measurement sphere center coordinates, measurement sphere center radius, etc.; the sphere center measurement data may include measurement coordinate system and measurement sphere center coordinates, measurement sphere center radius, and the measurement data is recorded in a specific compilation language. Therefore, by mastering a specific programming language, specific characters can be recognized from the measurement data, thereby realizing automatic reading of the sphere center point cloud data.

[0075] In step S102 above, since the number of sphere center point clouds measured on the blade is in the millions, the number of spheres involved in the Boolean operation will also be in the millions. One sphere intersects with thousands of surrounding spheres. However, the boundaries of incomplete spheres are complex, making it extremely difficult to directly obtain a Boolean entity model or mathematical expression. Even mature 3D modeling software on the market cannot easily achieve this. Therefore, the only option is to reduce the dimensionality to reduce the computational complexity.

[0076] Therefore, the cross-sectional boundary of the sphere within the evaluation section is a cross-sectional circle of unequal radius. The union area composed of all spherical cross-sections is the cross-sectional area of ​​the Boolean entity on the evaluation section. The boundary line of the union area is the contour line of the Boolean entity, and the boundary line of the union area can be accurately solved through the geometric relationship between the cross-sectional circles. After this processing, the three-dimensional operation between spheres is reduced to a two-dimensional operation between cross-sectional circles, thereby reducing the dimension of the three-dimensional sphere center point cloud data to two-dimensional cross-sectional circle data. Therefore, the problem of solving the cross-sectional line of the Boolean entity is transformed into the problem of dealing with the intersection relationship of the cross-sectional circles, which greatly reduces the difficulty and amount of calculation. For turbine blades, the Boolean entity cross-sectional area is a single-hole connected area. The boundary lines of the union area are inner and outer, of which the inner boundary line is the measured blade profile contour line.

[0077] Specifically, in the measurement coordinate system CS M The blade disk rotation center coincides with the Z axis, and the blade stacking axis L S The angle between the X axis and the XS , evaluation section PLN E Is perpendicular to the blade stacking axis L S And the distance to the center of rotation is d PEFor the convenience of calculation, it is advisable to rotate the actual sphere center and the evaluation section around the rotation center (Z axis) by -θ at the same time. XS Angle, so that the stacking axis coincides with the X axis. The actual number of sphere center points is recorded as N sc , the center point P sci (x sci ,y sci ,z sci ) constitutes the actual sphere center point set, recorded as The rotation matrix of the rotation is:

[0078]

[0079] The set of sphere center points after rotation is recorded as The evaluation section equation after rotation is x=d PE .

[0080] It should be noted that what is obtained after scanning is the sphere center point cloud data, and what is obtained after dimensionality reduction is the two-dimensional cross-sectional circle data. The sphere center written in this plan actually refers to the same coordinate as the center of the two-dimensional circle; similarly, the sphere referred to by the sphere center point cloud data and the circle referred to by the two-dimensional cross-sectional circle data after dimensionality reduction are actually the same reference.

[0081] In the above S103, based on the two-dimensional cross-sectional circle data, arc sections of multiple two-dimensional cross-sectional circles are intercepted, so as to obtain a contour arc of the two-dimensional cross-sectional circle. The number of intercepted two-dimensional cross-sectional circles is multiple, so multiple contour arcs are also obtained.

[0082] Optionally, in an example, the above S103 may include:

[0083] S1031, sequentially selecting each two-dimensional cross-sectional circle from a plurality of two-dimensional cross-sectional circles as a first target two-dimensional cross-sectional circle;

[0084] S1032: For each first target two-dimensional cross-sectional circle, perform the following steps AC respectively to obtain the contour arc corresponding to each first target two-dimensional cross-sectional circle;

[0085] Step A: determining a plurality of intersecting circles intersecting with the first target two-dimensional cross-sectional circle based on the first target two-dimensional cross-sectional circle data of the first target two-dimensional cross-sectional circle and the two-dimensional cross-sectional circle data of the plurality of two-dimensional cross-sectional circles;

[0086] Step B: determining the union angle domain of the first target two-dimensional cross-sectional circle according to the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data of each intersecting circle;

[0087] Step C: When the union angle domain of the first target two-dimensional cross-sectional circle is not equal to the full angle domain of the first target two-dimensional cross-sectional circle, determine the arc of the first target two-dimensional cross-sectional circle corresponding to the union angle domain as the contour arc of the first target two-dimensional cross-sectional circle.

[0088] In the above S1031, any one of the two-dimensional cross-sectional circles is selected as the first target two-dimensional cross-sectional circle in turn from the multiple two-dimensional cross-sectional circles. For example, after one of the multiple two-dimensional cross-sectional circles is selected as the first target two-dimensional cross-sectional circle, one of the remaining two-dimensional cross-sectional circles is selected again as the first target two-dimensional cross-sectional circle.

[0089] In the above S1032 , the operations of step A to step C are respectively performed for each selected first target two-dimensional cross-sectional circle, so as to obtain a contour arc from the first target two-dimensional cross-sectional circle.

[0090] In the above step A, the first target two-dimensional cross-sectional circle can be determined in the coordinate system based on the first target two-dimensional cross-sectional circle data. Similarly, in the same coordinate system, a two-dimensional cross-sectional circle can also be obtained based on the two-dimensional cross-sectional circle data annotation, and calculation can be performed based on the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data to obtain an intersecting circle that intersects with the first target two-dimensional cross-sectional circle among multiple two-dimensional cross-sectional circle data.

[0091] Specifically, first select the spheres that can intersect with the evaluation section from all spheres. The screening principle is that the distance from the sphere center to the evaluation section is less than the measuring sphere radius. The sphere center points that meet the screening principle are combined into a set of candidate sphere center points for solving the blade profile. The measuring sphere radius is denoted as R prb , the center point P scti (x scti ,y scti ,z scti ) to the evaluation section PLN E The distance d pi .

[0092] d pi =|x scti -d PE |

[0093] The screening condition for the candidate sphere center point set is d pi <R prb The selected sphere center is denoted as P scsi (x scsi ,y scsi ,z scsi ), the candidate sphere center point set is recorded as N ss is the number of candidate sphere center points, and the sphere center point P scsi To the evaluation section PLN E The distance is still recorded as dpi .

[0094] The intersection operation between a sphere and a plane is relatively simple. M The origin of the cross section is translated along the X axis to the evaluation section, and the plane coordinate system YOZ is established, which is called the evaluation coordinate system. In the evaluation coordinate system, the center set of the cross section circle is recorded as The coordinates of the center of the circle are P cci (y cci ,z cci ), with a radius of R ci , cross-sectional circle Cir i The equation is:

[0095]

[0096] in,

[0097]

[0098] Finally, the overlapping cross-sectional circles with the same center and equal radius are eliminated.

[0099] In the above step B, the union angle domain refers to the union of the angles of intersection between the first target two-dimensional cross-sectional circle and all intersecting circles. The angles of intersection between the first target two-dimensional cross-sectional circle and each intersecting circle are calculated separately, and then merged and set, so as to obtain the union angle domain of the first target two-dimensional cross-sectional circle data.

[0100] More specifically, the above step B may include:

[0101] S10321, for each intersecting circle, execute the following steps D and E respectively;

[0102] Step D: calculating the first intersection point coordinates and the second intersection point coordinates of the first target two-dimensional cross-sectional circle and the intersecting circle based on the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data of the intersecting circle;

[0103] Step E: Calculating the intersection angle domain between the first target two-dimensional cross-section circle and the intersection circle according to the coordinates of the first intersection point and the coordinates of the second intersection point;

[0104] S10322: Merge the first target two-dimensional cross-sectional circle and the intersection angle domain of each intersection circle respectively to obtain the union angle domain of the first target cross-sectional circle.

[0105] In the above S10321, since there are multiple intersecting circles intersecting with the first target two-dimensional cross-sectional circle, the following steps D to E are performed for each intersecting circle to obtain the intersection angle domain between each intersecting circle and the first target two-dimensional cross-sectional circle.

[0106] In the above step D, the intersection point is calculated based on the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data, and the first intersection point coordinates and the second intersection point coordinates of the first target two-dimensional cross-sectional circle and the intersection circle can be calculated.

[0107] Specifically, in one example, the first target two-dimensional cross-sectional circle Cir T The center P TC Establish the target coordinate system CS for the origin T1 , choose any intersecting circle as the first intersecting circle Cir I1 , the center of the first target two-dimensional cross-section circle P TC The center of the circle intersecting with the first point P IC1 The connection P TC P IC1 X as the target system T1 axis, then Y T1 The axis is determined.

[0108] Traverse the first target two-dimensional cross-section circle Cir in sequence T Other intersecting circles of . Take the kth intersecting circle Cir Ik For example, take the center of the first target two-dimensional cross-section circle P TC Establish a temporary coordinate system CS for the origin Tk , the center of the first target two-dimensional cross-section circle P TC Intersecting circle Cir Ik The center P ICk Connection established X Tk Axis. Temporary coordinate system CS Tk X Tk Axis and target coordinate system CS T1 X T1 The angle between the axes is β Tk , β Tk ∈[-180,180], all angles in this paper follow the right-hand rule, and the counterclockwise direction is positive.

[0109] In the temporary coordinate system CS Tk Next, the first target two-dimensional cross-section circle Cir T The expression is:

[0110]

[0111] Among them, R T is the radius of the first target two-dimensional cross-section circle, i=1,2,3....... Intersection circle Cir Ik The expression is:

[0112]

[0113] Among them, R Ikis the radius of the intersecting circle, k=1,2,3......, the distance between the centers of the two circles is d Tk =|P TC P ICk |.

[0114] The intersection of the two circles is about X Tk Axis symmetry, two intersection points P Tk1 、P Tk2 X coordinate:

[0115]

[0116] It should be noted that if the first target two-dimensional cross-section circle and the intersection circle intersect at only one intersection point, there is no contour arc between the first target two-dimensional cross-section circle and the intersection circle, and therefore they do not participate in subsequent calculations.

[0117] In the above step E, after the first target two-dimensional cross-sectional circle is known and the coordinates of the first intersection point and the second intersection point are determined, the angle range of the line connecting the first intersection point coordinate and the center of the first target two-dimensional cross-sectional circle and the line connecting the second intersection point coordinate and the center of the first target two-dimensional cross-sectional circle can be calculated, that is, the intersection angle domain.

[0118] Specifically, X Tk Intersection point P on the axis Tk1 To the origin P TC Connection with X Tk Angle θ between the axes Tk ,

[0119]

[0120] Angle θ Tk The value range is [-180,180]. The arc between the two intersection points is located on the intersection circle Cir Ik Internally, the center angle domain of this arc is

[0121] U Tk =[-θ Tk +β Tk ,θ Tk +β Tk ]

[0122] The center angle domain U obtained in the above formula Tk It may exceed the range of the global domain U0 = [0,360], so further processing is required, and U Tk =[α Tk1 ,α Tk2 ], α Tk1 , α Tk2 ∈[-360,360].

[0123] The angle range conversion rules are as follows:

[0124] 1) When α Tk1 <0,α Tk2 <0, let U Tk =[360+α Tk1 ,360+α Tk2 ];

[0125] 2) When α Tk1 <0,α Tk2 >0, let U Tk =[0,α Tk2 ]∪[360+α Tk1 ,360];

[0126] 3) When α Tk1 >0,α Tk2 >0, let U Tk =[α Tk1 ,α Tk2 ].

[0127] In the above S10322, the intersection angle domains obtained by intersecting the first target two-dimensional cross-section circle with each intersection circle are merged to obtain a union, thereby obtaining the union angle domain of the first target two-dimensional cross-section circle.

[0128] Specifically, if there are N intersecting circles of the first target two-dimensional cross-section circle, N circle center angle domains will be obtained. These angle domains are range-converted and combined to obtain the first target two-dimensional cross-section circle Cir T The union angle domain U T ,

[0129] U T =U T1 ∪U T2 ∪…∪U TN

[0130] In the above step C, the omnidirectional angle of the circle is 360°, so the angle domain of the first target two-dimensional cross-section circle is [-180°, +180°]. By comparing the union angle domain U T And the range of the whole domain U0, we can determine the first target two-dimensional cross-section circle Cir T Is there an external arc on the T = U0, the first target 2D cross-section circle is completely inside the other circles and cannot provide an external arc; if There is an external arc on the first target two-dimensional cross-section circle, and the mapping center angle domain of the external arc is U T The complement of C U0 U T . Calculate the outer arcs on each first target two-dimensional cross-section circle one by one until the end.

[0131] In the above S104, each contour arc is sequentially connected end to end, and the resulting closed figure is the blade profile contour line.

[0132] Example 2:

[0133] The above S103 may further include:

[0134] S1033, determining two preset center points with the farthest distance between their centers from the multiple two-dimensional cross-sectional circles;

[0135] S1034, determining the midpoint of the line connecting the two preset circle center points as the leaf chord center point;

[0136] S1035 , obtaining multiple contour arcs from multiple two-dimensional cross-sectional circles according to the center point of the blade chord.

[0137] In the above example, by determining the preset center points of the two circles with the greatest distance between their centers from multiple two-dimensional cross-sectional circles, the arc of the two-dimensional cross-sectional circle corresponding to the preset center points is bound to be located on the blade profile. This allows the blade chord center point located in the middle of the blade profile to be determined based on the preset center points. Based on the blade chord center points, the two-dimensional cross-sectional circles located at the blade chord edge are then found, and multiple contour arcs are intercepted from them. This allows the two-dimensional cross-sectional circles located at the blade edge to be more accurately selected, eliminating the need to calculate and intercept each two-dimensional cross-sectional circle, reducing computational complexity and improving the efficiency of intercepting two-dimensional cross-sectional circles.

[0138] In the above S1033, based on each two-dimensional cross-sectional circle data, two two-dimensional cross-sectional circles with the farthest distance are selected from the multiple two-dimensional cross-sectional circles, and the preset center points of the two two-dimensional cross-sectional circles with the farthest distance are respectively extracted.

[0139] Specifically, in one example, the above S1033 may include:

[0140] S10331; Analyze multiple two-dimensional cross-sectional circle data using a linear dimensionality reduction algorithm to determine the blade chord direction;

[0141] S10332: Determine, from the plurality of two-dimensional cross-sectional circle data, the two center points with the farthest projection distance in the blade chord direction as the preset center points.

[0142] Based on the above example, a linear algorithm is used to compress the 2D cross-sectional circle data into a low-dimensional space while retaining key features. This allows for better determination of the chordal direction of the blade chord. Once the chordal direction is determined, the two circles with the greatest projected distance along the chord can be identified based on the chordal shape and the 2D cross-sectional circle data. This improves the accuracy of determining the two circles with the greatest distance along the blade chord.

[0143] In the above S10331, since the blade chord direction is the direction of the leading and trailing edges of the blade profile, and is the direction with the largest span of the blade profile, the center point set of the cross-section circle is most widely distributed in the blade chord direction, and this characteristic just meets the application scenario of the principal component analysis (PCA). The PCA analysis method is a linear dimensionality reduction algorithm. Its goal is to use variance to measure the difference of data and project high-dimensional data with large differences into a low-dimensional space for representation. The working principle of the PCA analysis method is to find a set of mutually orthogonal coordinate axes from the original high-dimensional space in sequence. The first new coordinate axis is the direction with the largest variance in the original data. The second new coordinate axis is the direction with the largest variance in the plane orthogonal to the first coordinate axis. The third new coordinate axis is the direction with the largest variance in the plane orthogonal to the first and second new coordinate axes, and so on.

[0144] The PCA analysis method mainly involves the following concepts. Assume that there is a sample X = {x1, x2, ..., x n}、Sample Y={y1,y2,…,y n} and samples Z={z1,z2,…,z n},

[0145] The mean of sample X:

[0146]

[0147] The variance of sample X is:

[0148]

[0149] The covariance of sample X and sample Y is:

[0150]

[0151] Do the same process on samples Y and Z and construct the covariance matrix C:

[0152]

[0153] The covariance matrix C is decomposed using eigenvalue SVD to obtain three eigenvectors corresponding to the three principal component directions.

[0154] In this case, the analysis object is the center point P of the two-dimensional cross-section circle. cci (y cci ,z cci ), the number of samples is 2. Use matrix operations to construct the matrix M:

[0155]

[0156] De-mean the samples:

[0157]

[0158] in,

[0159]

[0160] Construct a 2×2 covariance matrix:

[0161]

[0162] The covariance matrix is ​​a symmetric matrix. The eigenvalue method is used to decompose the matrix C. The eigenvector corresponding to the eigenvalue with the largest absolute value is the principal component direction, that is, the leaf chord direction v pcl , the other eigenvector is in the leaf thickness direction v pcw .

[0163] In the above S10332, based on the data of multiple two-dimensional cross-sectional circles, the centers of multiple two-dimensional cross-sectional circles can be found. The centers of multiple two-dimensional cross-sectional circles form a two-dimensional cross-sectional circle center set. Two points are found from the two-dimensional cross-sectional circle center set. These two points are in the blade chord direction v. pcvl The upper projection distance is the largest, and the midpoint of the line connecting these two points is taken as the leaf chord center point P plc The curvature of the blade profile on each evaluation section is different, and the blade chord center P plc It is possible to be located inside or outside the actual blade profile. Then, a set of points is selected from the center points of the two-dimensional cross-section circle. This set of points is located at a distance of P from the center of the blade chord in the direction of the blade chord. plc The projection distance is less than m times the theoretical point spacing D Pn , usually m = 1 to 3. The selected set of circle center points is used as a new point set, temporarily called the leaf center point set. From the leaf center point set, find two points whose projection distance in the leaf thickness direction is the largest, and take the midpoint of the line connecting these two points as the contour center point P. pfc There are shape deviations and relative position deviations between the measured blade profile and the actual blade profile, but the combined value of these deviations is much smaller than the blade thickness in the middle of the blade chord. This method can ensure that the center point P of the constructed profile is pfc Still inside the measured blade profile.

[0164] In the above S1034, the two preset center points are connected to each other to obtain a connecting line, and the coordinates of the midpoint of the connecting line are obtained. Since the connecting line is the line connecting the two farthest preset center points in all two-dimensional cross-sectional circles, the midpoint of the connecting line is also the midpoint of the entire blade, that is, the midpoint is used as the center point of the blade chord.

[0165] In the above S1035, after the midpoint of the blade is determined according to the center point of the blade chord, the outermost two-dimensional cross-sectional circle of the blade can be determined according to the center point of the blade chord, thereby intercepting contour arcs from the multiple outermost two-dimensional cross-sectional circles respectively, thereby obtaining multiple contour arcs.

[0166] Specifically, in one example, the above S1035 may further include:

[0167] S10351, selecting a second target two-dimensional cross-sectional circle from a plurality of two-dimensional cross-sectional circles according to the center point of the blade chord;

[0168] S10352, solving the second target two-dimensional cross-sectional circle by an external arc algorithm to obtain a second target contour arc of the second target two-dimensional cross-sectional circle;

[0169] S10353: Determine multiple contour arcs in sequence according to the start and end points of the second target contour arc.

[0170] In the above example, by selecting a second target 2D cross-sectional circle from multiple 2D cross-sectional circles based on the leaf chord center point and then solving for the second target 2D cross-sectional circle, a second target contour arc can be intercepted from the second target 2D cross-sectional circle. This allows multiple contour arcs to be sequentially determined based on the start and end points of the second target contour arc, following the characteristic of arcs being adjacent at both ends. This improves the accuracy of determining the second target 2D cross-sectional circle and makes it easier to determine multiple contour arcs.

[0171] In the above S10351, based on the center point of the blade chord in the blade, a second target two-dimensional cross-sectional circle located at the edge of the blade profile is selected from a plurality of two-dimensional cross-sectional circles.

[0172] Specifically, in one example, the above S10351 may further include:

[0173] According to the two-dimensional cross-sectional circle data of each two-dimensional cross-sectional circle, the actual distance between the center point of each two-dimensional cross-sectional circle and the center point of the blade chord is calculated respectively;

[0174] Determine the difference between the radius of each two-dimensional cross-sectional circle and the corresponding actual distance;

[0175] The two-dimensional cross-sectional circle corresponding to the minimum difference value among the multiple difference values ​​is determined as the second target two-dimensional cross-sectional circle.

[0176] In the above example, by constructing the contour center point P pfc Then, the KD-TREE structure (tree data structure) of the center of each two-dimensional cross-section circle is established, and the corresponding center to the contour center point P is calculated according to the two-dimensional cross-section circle data of all two-dimensional cross-section circles. pfcThe actual distance is then determined, and the difference between the radius of each two-dimensional section circle and the corresponding actual distance is determined, that is, the distance from the center point of the section circle to the center point of the contour P. pfc The difference between the distance and its radius, and then the two-dimensional cross-sectional circle corresponding to the minimum value of the difference is selected as the first and second target two-dimensional cross-sectional circle Cir T1 .

[0177] In the above S10352, the external arc algorithm is further called to obtain the contour arc Arc1 located on the first second target two-dimensional cross-sectional circle. The contour arc Arc1 is the first contour arc on the measured blade profile contour line.

[0178] In the above S10353, according to the characteristic that the contour arc is connected from beginning to end, the end point P of the first contour arc Arc1 is connected from end to end. ed1 It is the starting point P of the second contour arc Arc2 st2 , so the second target two-dimensional cross-section circle passes through point P ed1 From point P ed1 Eliminate Cir from the cross-section circle T1 , the rest is the second target two-dimensional cross-section circle Cir T2 , and so on, sequentially track the second target two-dimensional cross-sectional circle, and at the same time solve the contour arc of each second target two-dimensional cross-sectional circle, thereby obtaining multiple contour arcs.

[0179] Example 3;

[0180] Based on the same inventive concept, this embodiment further provides a blade profile solving device 200 on the basis of Embodiment 1, which includes:

[0181] An acquisition module 210 is configured to acquire a sphere center point cloud data set of a blade, wherein the sphere center point cloud data set includes a plurality of sphere center point cloud data;

[0182] A dimensionality reduction module 220 is used to perform dimensionality reduction processing on each of the sphere center point cloud data to obtain two-dimensional cross-sectional circle data corresponding to each of the sphere center point cloud data, where the two-dimensional cross-sectional circle data corresponds to the two-dimensional cross-sectional circle;

[0183] The interception module 230 is used to intercept the plurality of two-dimensional cross-sectional circles respectively to obtain a plurality of contour arcs;

[0184] The connection module 240 is used to sequentially connect multiple segments of the contour arcs to obtain a blade profile line.

[0185] Based on the above embodiment, the acquisition module 210 acquires a three-dimensional sphere center point cloud data set related to the blade, and then the dimensionality reduction module 220 performs dimensionality reduction processing on each sphere center point cloud data to obtain a two-dimensional cross-sectional circle on the two-dimensional plane. The interception module 230 can then intercept a section of contour arc that can represent the blade profile from the two-dimensional cross-sectional circle, and the connection module 240 then connects the contour arcs end to end to obtain the entire blade profile contour line, thereby realizing the processing of the three-dimensional point cloud to obtain the blade profile contour line, thereby avoiding the problem of information loss caused by image grayscale mapping in conventional image scanning, and improving the accuracy of blade profile recognition.

[0186] Optionally, the interception module 230 may include:

[0187] a recurrence unit, configured to iteratively execute the following steps CE for P times to obtain a target feature extractor, a target fault classifier, and a target domain discriminator, wherein P is a positive integer;

[0188] A first selection unit is configured to sequentially select each of the two-dimensional cross-sectional circles from the plurality of the two-dimensional cross-sectional circles as a first target two-dimensional cross-sectional circle;

[0189] A first interception unit is configured to execute the following steps AC for each of the first target two-dimensional cross-sectional circles, respectively, to obtain a contour arc corresponding to each of the first target two-dimensional cross-sectional circles;

[0190] Step A: determining a plurality of intersecting circles intersecting with the first target two-dimensional cross-sectional circle based on the first target two-dimensional cross-sectional circle data of the first target two-dimensional cross-sectional circle and the two-dimensional cross-sectional circle data of the plurality of two-dimensional cross-sectional circles;

[0191] Step B: determining the union angle domain of the first target two-dimensional cross-sectional circle according to the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data of each of the intersecting circles;

[0192] Step C: When the union angle domain of the first target two-dimensional cross-sectional circle is not equal to the full angle domain of the first target two-dimensional cross-sectional circle, determine the arc of the first target two-dimensional cross-sectional circle corresponding to the union angle domain as the contour arc of the first target two-dimensional cross-sectional circle.

[0193] Optionally, step B may include:

[0194] For each of the intersecting circles, perform the following steps DE respectively;

[0195] Step D: calculating the first intersection coordinates and the second intersection coordinates of the first target two-dimensional cross-sectional circle and the intersecting circle based on the first target two-dimensional cross-sectional circle data of the first target two-dimensional cross-sectional circle and the two-dimensional cross-sectional circle data of the intersecting circle;

[0196] Step E: calculating the intersection angle domain between the first target two-dimensional cross-section circle and the intersection circle according to the first intersection point coordinates and the second intersection point coordinates;

[0197] The first target two-dimensional cross-sectional circle and the intersection angle domain of each of the intersection circles are respectively merged to obtain the union angle domain of the first target cross-sectional circle.

[0198] Optionally, the interception module 230 may further include:

[0199] A first determining unit is configured to determine, from the plurality of two two-dimensional cross-sectional circles, two preset center points with the largest distance between their centers;

[0200] A second determining unit is used to determine the midpoint of the line connecting the centers of the two preset center points as the blade chord center point;

[0201] The second interception unit is used to intercept a plurality of contour arcs from the plurality of two-dimensional cross-sectional circles according to the center point of the blade chord.

[0202] Optionally, the first determining unit may include:

[0203] A first determining subunit is configured to analyze the plurality of two-dimensional cross-sectional circle data by a linear dimensionality reduction algorithm to determine a blade chord direction;

[0204] The second determining subunit is used to determine, from the plurality of two-dimensional cross-sectional circle data, two circle center points with the farthest projection distance in the blade chord direction as preset circle center points.

[0205] Optionally, the second interception unit may include:

[0206] a selection subunit, configured to select a second target two-dimensional cross-sectional circle from the plurality of two-dimensional cross-sectional circles according to the blade chord center point;

[0207] a solving subunit, configured to solve the second target two-dimensional cross-sectional circle by an external arc algorithm to obtain a second target contour arc of the second target two-dimensional cross-sectional circle;

[0208] The third determining subunit is configured to sequentially determine a plurality of the contour arcs according to the starting and ending points of the second target contour arc.

[0209] Optionally, the selection subunit may include:

[0210] a calculation component, configured to calculate the actual distance between the center of each of the two-dimensional cross-sectional circles and the center point of the blade chord according to the two-dimensional cross-sectional circle data of each of the two-dimensional cross-sectional circles;

[0211] A first determining component is used to determine the difference between the radius of each of the two-dimensional cross-sectional circles and the corresponding actual distance;

[0212] The second determining component is used to determine the two-dimensional cross-sectional circle corresponding to the minimum difference value among the plurality of the differences as the second target two-dimensional cross-sectional circle.

[0213] In Example 3, each process of the above-mentioned Example 1 and / or Example 2 can be implemented and the same technical effect can be achieved. To avoid repetition, it will not be described here.

[0214] Example 4:

[0215] Figure 3 A schematic diagram of the hardware structure of a blade profile solution device provided by an embodiment of the present invention is shown.

[0216] The airfoil profile solving device may include a processor 301 and a memory 302 storing computer program instructions.

[0217] Specifically, the processor 301 may include a central processing unit (CPU), or an application specific integrated circuit (ASIC), or may be configured to implement one or more integrated circuits of the embodiment of the present invention.

[0218] The memory 302 may include a large capacity memory for data or instructions. By way of example and not limitation, the memory 302 may include a hard disk drive (HDD), a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a magnetic tape, or a universal serial bus (USB) drive, or a combination of two or more of these. Where appropriate, the memory 302 may include removable or non-removable (or fixed) media. Where appropriate, the memory 302 may be inside or outside the integrated gateway disaster recovery device. In a specific embodiment, the memory 32 is a non-volatile solid-state memory.

[0219] In certain embodiments, the memory 302 may include read-only memory (ROM), random access memory (RAM), magnetic disk storage media devices, optical storage media devices, flash memory devices, electrical, optical, or other physical / tangible memory storage devices. Thus, generally, the memory 302 includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors 301), it is operable to perform the operations described with reference to the method according to an aspect of the present application.

[0220] The processor 301 reads and executes computer program instructions stored in the memory 302 to implement any one of the methods for solving the blade profile line in the above embodiments.

[0221] In one example, the airfoil profile solving device may further include a communication interface 303 and a bus 304. As shown in the figure, the processor 301, the memory 302, and the communication interface 303 are connected via the bus 304 and communicate with each other.

[0222] The communication interface 303 is mainly used to implement communication between various modules, devices, units and / or equipment in the embodiment of the present invention.

[0223] Bus 304 includes hardware, software or both. For example, but not limitation, bus 304 may include accelerated graphics port (AGP) or other graphics bus, enhanced industry standard architecture (EISA) bus, front side bus (FSB), hypertransport (HT) interconnection, industry standard architecture (ISA) bus, wireless bandwidth interconnection, low pin count (LPC) bus, memory bus, micro channel architecture (MCA) bus, peripheral control interconnect (PCI) bus, PCI-Express (PCI-X) bus, serial advanced technology attachment (SATA) bus, video electronics standard association local (VLB) bus or other suitable bus or two or more of these combinations. Where appropriate, bus 304 may include one or more buses 304. Although the present application embodiment describes and shows specific bus 304, the application considers any suitable bus 304 or interconnection.

[0224] The blade profile solution device can be based on the current blade profile solution method, thereby achieving the combination of Figure 1 、 2 A method for solving an airfoil profile line and an apparatus 200 for solving an airfoil profile line are described.

[0225] In addition, an embodiment of the present application further provides a computer program product, including computer program instructions. When the computer program product is executed by the processor 301, the steps and corresponding contents of the aforementioned method embodiment can be implemented.

[0226] It should be understood that the present application is not limited to the specific configurations and processes described above and illustrated in the figures. For the sake of brevity, a detailed description of known methods is omitted here. In the above embodiments, several specific steps are described and illustrated as examples. However, the method process of the present application is not limited to the specific steps described and illustrated. Those skilled in the art can make various changes, modifications, and additions, or change the order of the steps after understanding the spirit of the present application.

[0227] The functional blocks shown in the above-described block diagram can be implemented as hardware, software, firmware or a combination thereof. When implemented in hardware, they can be, for example, electronic circuits, application specific integrated circuits (ASICs), appropriate firmware, plug-ins, function cards, etc. When implemented in software, the elements of the present application are programs or code segments that are used to perform the required tasks. The program or code segment can be stored in a machine-readable medium, or transmitted on a transmission medium or a communication link by a data signal carried in a carrier wave. "Machine-readable medium" can include any medium that can store or transmit information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, ROMs, flash memories, erasable ROMs (EROMs), floppy disks, CD-ROMs, optical disks, hard disks, optical fiber media, radio frequency (RF) links, etc. The code segment can be downloaded via a computer network such as the Internet, an intranet, etc.

[0228] It should also be noted that the exemplary embodiments mentioned in this application describe some methods or systems based on a series of steps or devices. However, this application is not limited to the order of the above steps. In other words, the steps can be performed in the order mentioned in the embodiments, or in a different order, or several steps can be performed simultaneously.

[0229] Aspects of the present disclosure are described above with reference to flowcharts and / or block diagrams of methods, apparatuses (systems), and computer program products according to embodiments of the present disclosure. It should be understood that each block in the flowcharts and / or block diagrams, and combinations of blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable airfoil profile solution method, apparatus, and device to produce a machine such that these instructions, when executed by a processor of the computer or other programmable airfoil profile solution method, apparatus, and device, enable the implementation of the functions / actions specified in one or more blocks in the flowcharts and / or block diagrams. Such a processor can be, but is not limited to, a general-purpose processor, a special-purpose processor, a special application processor, or a field programmable logic circuit. It should also be understood that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can also be implemented by dedicated hardware that performs the specified functions or actions, or can be implemented by a combination of dedicated hardware and computer instructions.

[0230] The above description is only a specific embodiment of the present application. Those skilled in the art will clearly understand that for the convenience and brevity of description, the specific working processes of the systems, modules and units described above can refer to the corresponding processes in the aforementioned method embodiments, and will not be repeated here. It should be understood that the scope of protection of the present application is not limited thereto. Any person skilled in the art can easily think of various equivalent modifications or replacements within the technical scope disclosed in the present application, and these modifications or replacements should be included in the scope of protection of the present application.

Claims

1. A method for solving blade profile line, characterized in that: The steps of the method are as follows: Acquire a spherical center point cloud data set of a blade, wherein the spherical center point cloud data set includes a plurality of spherical center point cloud data; Performing dimensionality reduction processing on each of the sphere center point cloud data to obtain two-dimensional cross-sectional circle data corresponding to each of the sphere center point cloud data, wherein the two-dimensional cross-sectional circle data corresponds to the two-dimensional cross-sectional circle; intercepting the plurality of two-dimensional cross-sectional circles respectively to obtain a plurality of contour arcs; The blade profile is obtained by sequentially connecting multiple segments of the contour arcs.

2. The method for calculating the blade profile according to claim 1, wherein: The step of intercepting the plurality of two-dimensional cross-sectional circles to obtain a plurality of contour arcs comprises: Selecting each of the two-dimensional cross-sectional circles in sequence from the plurality of the two-dimensional cross-sectional circles as a first target two-dimensional cross-sectional circle; For each of the first target two-dimensional cross-sectional circles, respectively perform the following steps AC to obtain the contour arc corresponding to each of the first target two-dimensional cross-sectional circles; Step A: determining a plurality of intersecting circles intersecting with the first target two-dimensional cross-sectional circle based on the first target two-dimensional cross-sectional circle data of the first target two-dimensional cross-sectional circle and the two-dimensional cross-sectional circle data of the plurality of two-dimensional cross-sectional circles; Step B: determining the union angle domain of the first target two-dimensional cross-sectional circle according to the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data of each of the intersecting circles; Step C: When the union angle domain of the first target two-dimensional cross-sectional circle is not equal to the full angle domain of the first target two-dimensional cross-sectional circle, determine the arc of the first target two-dimensional cross-sectional circle corresponding to the union angle domain as the contour arc of the first target two-dimensional cross-sectional circle.

3. The method for calculating the blade profile line according to claim 2, wherein: The determining of the union angle domain of the first target two-dimensional cross-sectional circle according to the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data of each of the intersecting circles includes: For each of the intersecting circles, perform the following steps DE respectively; Step D: calculating the first intersection coordinates and the second intersection coordinates of the first target two-dimensional cross-sectional circle and the intersecting circle based on the first target two-dimensional cross-sectional circle data of the first target two-dimensional cross-sectional circle and the two-dimensional cross-sectional circle data of the intersecting circle; Step E: calculating the intersection angle domain between the first target two-dimensional cross-section circle and the intersection circle according to the first intersection point coordinates and the second intersection point coordinates; The first target two-dimensional cross-sectional circle and the intersection angle domain of each of the intersection circles are respectively merged to obtain the union angle domain of the first target cross-sectional circle.

4. The method for calculating the blade profile according to claim 1, wherein: The step of intercepting the plurality of two-dimensional cross-sectional circles to obtain a plurality of contour arcs comprises: Determining two preset center points with the farthest distance between the centers of the circles from the plurality of two-dimensional cross-sectional circles; Determine the midpoint of the line connecting the centers of the two preset center points as the leaf chord center point; A plurality of contour arcs are obtained by intercepting a plurality of the two-dimensional cross-sectional circles according to the center point of the blade chord.

5. The method for calculating the blade profile line according to claim 4, wherein: Determining two preset center points with the farthest center distance from each other from the plurality of two-dimensional cross-sectional circles includes: Analyzing the plurality of two-dimensional cross-sectional circle data by a linear dimensionality reduction algorithm to determine the blade chord direction; The two center points with the longest projection distance in the blade chord direction are determined from the plurality of two-dimensional cross-sectional circle data as preset center points.

6. The method for calculating the blade profile line according to claim 4, wherein: Obtaining multiple segments of the contour arcs from multiple two-dimensional cross-sectional circles according to the center point of the blade chord includes: Selecting a second target two-dimensional cross-sectional circle from the plurality of two-dimensional cross-sectional circles according to the blade chord center point; Solving the second target two-dimensional cross-sectional circle by an external arc algorithm to obtain a second target contour arc of the second target two-dimensional cross-sectional circle; A plurality of the contour arcs are determined in sequence according to the starting and ending points of the second target contour arc.

7. The method for calculating the blade profile according to claim 6, wherein: The selecting a second target two-dimensional cross-sectional circle from the plurality of two-dimensional cross-sectional circles according to the blade chord center point comprises: Calculating the actual distance between the center of each two-dimensional cross-sectional circle and the center point of the blade chord according to the two-dimensional cross-sectional circle data of each two-dimensional cross-sectional circle; Determine the difference between the radius of each of the two-dimensional cross-sectional circles and the corresponding actual distance; The two-dimensional cross-sectional circle corresponding to the minimum difference value among the plurality of the differences is determined as the second target two-dimensional cross-sectional circle.

8. A device for calculating blade profile, characterized in that: The device comprises: An acquisition module is used to acquire a spherical center point cloud data set of a blade, wherein the spherical center point cloud data set includes a plurality of spherical center point cloud data; A dimensionality reduction module is used to perform dimensionality reduction processing on each of the sphere center point cloud data to obtain two-dimensional cross-sectional circle data corresponding to each of the sphere center point cloud data, where the two-dimensional cross-sectional circle data corresponds to the two-dimensional cross-sectional circle; An interception module, configured to intercept the plurality of two-dimensional cross-sectional circles respectively to obtain a plurality of contour arcs; The connection module is used to sequentially connect multiple segments of the contour arcs to obtain a blade profile line.

9. The device according to claim 8, wherein The interception module includes: a recurrence unit, configured to iteratively execute the following steps CE for P times to obtain a target feature extractor, a target fault classifier, and a target domain discriminator, wherein P is a positive integer; A first selection unit is configured to sequentially select each of the two-dimensional cross-sectional circles from the plurality of the two-dimensional cross-sectional circles as a first target two-dimensional cross-sectional circle; A first interception unit is configured to execute the following steps AC for each of the first target two-dimensional cross-sectional circles, respectively, to obtain a contour arc corresponding to each of the first target two-dimensional cross-sectional circles; Step A: determining a plurality of intersecting circles intersecting with the first target two-dimensional cross-sectional circle based on the first target two-dimensional cross-sectional circle data of the first target two-dimensional cross-sectional circle and the two-dimensional cross-sectional circle data of the plurality of two-dimensional cross-sectional circles; Step B: determining the union angle domain of the first target two-dimensional cross-sectional circle according to the first target two-dimensional cross-sectional circle data and the two-dimensional cross-sectional circle data of each of the intersecting circles; Step C: When the union angle domain of the first target two-dimensional cross-sectional circle is not equal to the full angle domain of the first target two-dimensional cross-sectional circle, determine the arc of the first target two-dimensional cross-sectional circle corresponding to the union angle domain as the contour arc of the first target two-dimensional cross-sectional circle.

10. The device according to claim 8, wherein The interception module includes: A first determining unit is configured to determine, from the plurality of two two-dimensional cross-sectional circles, two preset center points with the largest distance between their centers; A second determining unit is used to determine the midpoint of the line connecting the centers of the two preset center points as the blade chord center point; The second interception unit is used to intercept a plurality of contour arcs from the plurality of two-dimensional cross-sectional circles according to the center point of the blade chord.

Images