Two-dimensional multi-communication region construction method, device, equipment and medium
By constructing and processing geometric graphics files of aero engines, the multi-connection area is automatically identified, which solves the problems of low recognition efficiency and misjudgment caused by manual participation in the prior art, and achieves efficient and accurate multi-connection area recognition.
Patent Information
- Application Number
- CN202411612272.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-11-12
- Publication Date
- 2025-03-07
AI Technical Summary
In the prior art, when converting two-dimensional drawings or sketches of aircraft engines into three-dimensional digital models, the identification of multi-universal areas requires manual participation, resulting in low recognition efficiency and prone to misjudgment, which affects the reliability of the results.
By obtaining the geometric figure file of the target aircraft engine, a undirected graph to be processed is constructed and triangulated are performed to obtain the triangulated graph, and then a dual graph of the triangulated graph is constructed, and the multi-connection area information set is determined based on the connected components in the dual graph.
Automatic processing is realized, and the two-dimensional multi-connection area of the aircraft engine can be quickly and accurately identified without manual participation, improving the recognition accuracy and efficiency.
Smart Images

Figure CN119577960A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the technical field of digital mechanical design, and in particular to a two-dimensional multi-connected surface domain construction method, device, equipment and medium. Background Art
[0002] Aircraft engines are highly complex and sophisticated mechanical equipment. During the design process of aircraft engines, simulation technology can be used to help engineers predict and evaluate engine performance before actual manufacturing, thereby optimizing the design and reducing aircraft engine costs and development time. One of the important tasks is to quickly convert the two-dimensional drawings or sketches of aircraft engines into three-dimensional digital models.
[0003] In the related art, in the process of converting a two-dimensional drawing or sketch of an aircraft engine into a three-dimensional digital model, it is necessary to identify multi-connected surface areas based on the two-dimensional drawing or sketch in order to extract the basic shapes and sizes of the various components of the aircraft engine from the complex point and line data.
[0004] However, the multi-connected face recognition solutions provided in the related art usually require human participation, resulting in low recognition efficiency and prone to misjudgment, which affects the reliability of the obtained recognition results. Summary of the invention
[0005] The present disclosure is proposed in view of the above problems. The present disclosure provides a two-dimensional multi-connected surface area construction method, device, equipment and medium, which can improve the acquisition accuracy and efficiency of the multi-connected surface area.
[0006] According to one aspect of the present disclosure, a method for constructing a two-dimensional multi-connected surface area is provided, comprising:
[0007] Obtaining a geometric file of a target aircraft engine to be analyzed;
[0008] Based on the geometric feature data in the geometric figure file, construct an undirected graph to be processed, and perform triangulation processing on the first endpoint set in the undirected graph to be processed to obtain a triangulation graph;
[0009] A dual graph of the triangulation graph is constructed, and a multi-connected surface domain information set is determined according to a plurality of connected components in the dual graph.
[0010] According to another aspect of the present disclosure, a two-dimensional multi-connected surface area construction device is provided, comprising:
[0011] An acquisition module is configured to acquire a geometric figure file of a target aircraft engine to be analyzed;
[0012] A first processing module is configured to construct an undirected graph to be processed based on the geometric feature data in the geometric figure file, and perform triangulation processing on a first endpoint set in the undirected graph to be processed to obtain a triangulation graph;
[0013] The second processing module is configured to construct a dual graph of the triangulation graph, and determine a multi-connected surface domain information set according to a plurality of connected components in the dual graph.
[0014] According to another aspect of the present disclosure, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory, wherein the processor executes the computer program to implement the above-mentioned two-dimensional multi-connected surface area construction device.
[0015] According to another aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the above-mentioned two-dimensional multi-connected surface area construction device is implemented.
[0016] The two-dimensional multi-connected surface domain construction method, device, equipment and medium provided by the embodiments of the present disclosure obtain a geometric figure file of a target aircraft engine to be analyzed; then, based on the geometric feature data in the geometric figure file, construct an undirected graph to be processed, and triangulate the first endpoint set in the undirected graph to be processed to obtain a triangulated graph; finally, construct a dual graph of the triangulated graph, and determine a multi-connected surface domain information set based on multiple connected components in the dual graph; the multi-connected surface domain information set can be determined by automatically processing the geometric image data of the aircraft engine to be analyzed, and the multi-connected surface domains of the two-dimensional digital model of the aircraft engine can be quickly and accurately identified without human intervention, thereby improving the recognition accuracy and efficiency of the two-dimensional multi-connected surface domains. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] The above and other purposes, features and advantages of the present disclosure will become more apparent by describing the embodiments of the present disclosure in more detail in conjunction with the accompanying drawings. The accompanying drawings are used to provide a further understanding of the embodiments of the present disclosure and constitute a part of the specification. Together with the embodiments of the present disclosure, they are used to explain the present disclosure and do not constitute a limitation of the present disclosure. In the accompanying drawings, the same reference numerals generally represent the same components or steps.
[0018] Figure 1 It is a flowchart illustrating a method for constructing a two-dimensional multi-connected surface area according to an embodiment of the present disclosure.
[0019] Figure 2 is a two-dimensional geometric diagram of an aircraft engine according to an embodiment of the present disclosure.
[0020] Figure 3It is a schematic diagram illustrating multiple multi-connected surface areas according to an embodiment of the present disclosure.
[0021] Figure 4 It is a flowchart illustrating another method for constructing a two-dimensional multi-connected surface area according to an embodiment of the present disclosure.
[0022] Figure 5 It is a block diagram illustrating a two-dimensional multi-connected surface domain construction device according to an embodiment of the present disclosure.
[0023] Figure 6 is a schematic diagram illustrating a computer program product according to an embodiment of the present disclosure.
[0024] Figure 7 is a hardware block diagram illustrating an electronic device according to an embodiment of the present disclosure. DETAILED DESCRIPTION
[0025] In order to make the purpose, technical solution and advantages of the present disclosure more obvious, the exemplary embodiments according to the present disclosure will be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present disclosure, rather than all the embodiments of the present disclosure, and it should be understood that the present disclosure is not limited to the exemplary embodiments described here.
[0026] In the related art, in the process of identifying multi-connected surface areas in a two-dimensional drawing or sketch of an aircraft engine, staff are usually required to analyze the drawing or sketch and identify the multi-connected surface areas. In this process, omissions or incorrect identifications usually occur, resulting in unreliable determination of the multi-connected surface areas and requiring a lot of time and effort.
[0027] In order to solve the above problems, the embodiment of the present disclosure provides a two-dimensional multi-connected surface area construction method, which can be applied to a terminal device, which can be a computer, a notebook, a tablet computer or a server, etc. Figure 1 As shown, the method of the embodiment of the present disclosure may include:
[0028] Step S101, obtaining a geometric figure file of a target aircraft engine to be analyzed;
[0029] Step S102, constructing an undirected graph to be processed based on the geometric feature data in the geometric figure file, and performing triangulation processing on the first endpoint set in the undirected graph to be processed to obtain a triangulated graph;
[0030] Step S103, constructing a dual graph of the triangulation graph, and determining a multi-connected surface domain information set according to a plurality of connected components in the dual graph.
[0031] In summary, the two-dimensional multi-connected surface domain construction method provided by the embodiment of the present disclosure obtains the geometric figure file of the target aircraft engine to be analyzed; then, based on the geometric feature data in the geometric figure file, constructs the undirected graph to be processed, and triangulates the first endpoint set in the undirected graph to be processed to obtain a triangulated graph; finally, constructs the dual graph of the triangulated graph, and determines the multi-connected surface domain information set according to the multiple connected components in the dual graph; the multi-connected surface domain information set can be determined by automatically processing the geometric image data of the aircraft engine to be analyzed, and the multi-connected surface domains of the two-dimensional digital model of the aircraft engine can be quickly and accurately identified without human intervention, thereby improving the recognition accuracy and efficiency of the two-dimensional multi-connected surface domains.
[0032] The following Figure 1 The specific implementation methods of each step in the embodiment shown are described in detail:
[0033] In step S101, the terminal device obtains a geometric graphics file of a target aircraft engine to be analyzed.
[0034] In an embodiment of the present disclosure, the geometry file may be a file of a two-dimensional drawing or sketch of a target aircraft engine; the geometry file may include geometry feature data for characterizing the geometry features in the two-dimensional drawing or sketch, and the geometry feature data may include line parameters of lines such as line segments, polyline segments, spline curves, etc. in the geometry, wherein the line parameters may include parameter information such as the endpoint position, endpoint identification, center point, radius and / or connection relationship of the line.
[0035] It should be noted that in the embodiments of the present disclosure, the file format of the geometric graphics file can be determined based on actual needs, and the embodiments of the present disclosure do not limit this. For example, the geometric graphics file can be a file in the DXF format, and the entity segment data in the DXF format file records the geometric feature data of the geometric graphics in the drawing.
[0036] In an optional embodiment, the process of a terminal device acquiring a geometric graphics file of a target aircraft engine to be analyzed may include: in response to acquiring a two-dimensional multi-connected surface domain construction instruction regarding the target aircraft engine, based on a target aircraft engine identifier in the instruction, reading a pre-stored geometric graphics file of the target aircraft engine.
[0037] In step S102, the terminal device constructs an undirected graph to be processed based on the geometric feature data in the geometric graphics file, and performs triangulation processing on the first endpoint set in the undirected graph to be processed to obtain a triangulation graph.
[0038] In the embodiment of the present disclosure, the undirected graph G to be processed includes: a first endpoint set V and a first line segment set E, wherein the first endpoint set V is a set of line endpoints in the geometric figure of the target aircraft engine, and the first line segment set E represents a set of line segments connecting points in the geometric figure of the target aircraft engine.
[0039] In an optional embodiment, the process of constructing an undirected graph to be processed by the terminal device based on the geometric feature data in the geometric figure file may include: constructing a spatial graph to be processed based on the line parameters in the geometric feature data; wherein, if the spatial graph to be processed is a directed graph, converting the spatial graph to be processed into an undirected graph to obtain the undirected graph to be processed, and when the geometric figure contains directed line segments, the directional information in the geometric figure can be filtered by converting the directed graph into an undirected graph to obtain the precise geometric features in the geometric figure.
[0040] Among them, the process of constructing the spatial graph to be processed by the terminal device based on the line parameters in the geometric feature data may include: reading the line parameters of the lines in the geometric feature data, and combining the endpoint information of the lines in the line parameters to obtain a first endpoint set V, and combining the line information in the line parameters to obtain a first line segment set E, and determining the first endpoint set V and the first line segment set E as the spatial graph to be processed; wherein the endpoint information may include the endpoint position and the endpoint identification, the line information may include the two endpoints of the line, and the connection relationship between the two endpoints of the line, and the line information may also include connection direction information of the two endpoints of the line, etc.
[0041] Optionally, the terminal device may represent the spatial graph G to be processed by an adjacency matrix. For example, when the geometric figure includes endpoint 1, endpoint 2, and endpoint 3, and endpoint 1 is connected to endpoint 2, and endpoint 1 is connected to endpoint 3, the spatial graph G to be processed represented by the adjacency matrix is:
[0042]
[0043] Among them, the process of the terminal device converting the spatial graph to be processed into an undirected graph may include: determining the third endpoint set V′ in the directed graph as the first endpoint set V in the undirected graph, and, for each line in the third line segment set E′ of the directed graph, comparing the endpoints and connection relationships of the lines with the first line segment set E in the converted undirected graph, and when the first line segment set E does not contain lines consisting of the two endpoints of the lines, adding the line endpoints and the connection relationships of the endpoints to the first line segment set E in the converted undirected graph.
[0044] It can be understood that in the embodiment of the present disclosure, the process of the terminal device converting the spatial graph to be processed into an undirected graph can be expressed as: V=V′, and {(u, v)|(u, v)∈E or (v, u)∈E and u≠v}=E′, where v and u represent the two endpoints of the directed line segment.
[0045] In an optional implementation, if the spatial graph to be processed is a directed graph, and the directed graph is a weighted directed graph, the weight information is removed in the process of converting the spatial graph to be processed into an undirected graph. In the case where the geometric figure contains directed line segments, the directional information in the geometric figure can be filtered by converting the directed graph into an undirected graph, and the weight information can be removed to more accurately obtain the geometric features in the geometric figure.
[0046] In an optional embodiment, before triangulating the endpoint information in the undirected graph to obtain a triangulated graph, the terminal device can also: identify all target endpoints in the undirected graph to be processed whose degrees are preset values; and delete the target endpoints in the undirected graph to be processed, as well as the edges associated with the target endpoints, to obtain a first updated undirected graph, wherein the preset value is 1; all endpoints in the undirected graph to be processed whose degrees are 1 can be determined as hanging endpoints, and since hanging endpoints are endpoints of invalid lines that do not participate in geometric configurations, the accuracy of the determined multi-connected surface domain information can be improved by removing the hanging endpoints.
[0047] In an optional embodiment, the terminal device can also: determine the shortest path length of each edge in the first updated undirected graph; and delete the edges whose shortest path length is a preset length to obtain a second updated undirected graph, where the preset length is 1; the edges connecting the hanging endpoints in the undirected graph to be processed can be determined as single-tangent edges, and the single-tangent edges can be deleted. Since the edges connecting the hanging endpoints do not participate in the geometric configuration, the accuracy of the determined multi-connected surface domain information can be further improved.
[0048] For example, Figure 2 As shown, Figure 2 A two-dimensional geometric figure of an aircraft engine is shown, wherein the terminal device can determine the line 201 as a single tangent point edge and delete the single tangent point edge during the processing of the geometric figure file.
[0049] It should be noted that in the embodiment of the present disclosure, the terminal device triangulates the first endpoint set in the undirected graph to be processed to obtain a triangulated graph. This process can be implemented based on a triangulation algorithm. The triangulation algorithm can be a flanging algorithm, a point-by-point insertion algorithm, a split-merge algorithm, or a Bowyer-Watson algorithm, etc. The specific one can be determined based on actual needs, and the embodiment of the present disclosure does not limit this.
[0050] In an optional embodiment, the terminal device triangulates the first endpoint set in the undirected graph to be processed, and the process of obtaining the triangulated graph includes: determining the triangulation condition, wherein the triangulation condition is: if △ABC is part of the triangulated graph, then for all endpoints in the first endpoint set V of the undirected graph to be processed, there exists a circumscribed circle (A, B, C) ∩ V = {A, B, C}; then, starting from a set of initial endpoints in the first endpoint set V and the first line segment set E, the process of adding new endpoints is repeated, wherein, when the addition of new endpoints causes a violation of the triangulation condition, a flanging process is performed, and further, when all triangles satisfy the circumscribed circle condition and all endpoints in the first endpoint set V are added to the triangulation without flipping, it is determined that the triangulated graph is obtained.
[0051] It can be understood that in the embodiments of the present disclosure, after the terminal device obtains the first updated undirected graph and performs triangulation on the first endpoint set in the undirected graph to be processed, before obtaining the triangulated graph, the terminal device determines the first updated undirected graph as the undirected graph to be processed, and determines the fifth endpoint set in the first updated undirected graph as the first endpoint set; or, after the terminal device obtains the second updated undirected graph and performs triangulation on the first endpoint set in the undirected graph to be processed, before obtaining the triangulated graph, the terminal device determines the second updated undirected graph as the undirected graph to be processed, and determines the sixth endpoint set in the second updated undirected graph as the first endpoint set.
[0052] In step S103, the terminal device constructs a dual graph of the triangulation graph, and determines a multi-connected surface domain information set according to a plurality of connected components in the dual graph.
[0053] In the embodiment of the present disclosure, the triangulation graph T may include a second endpoint set V2 and a second line segment set E2; in the dual graph G* of the triangulation graph, the fourth endpoint set V* is a set consisting of a subset of vertices of each triangle in the triangulation graph, and the fourth line segment set E* is a set of edges connecting two adjacent triangles.
[0054] For example, if the triangulation graph contains n triangles, then in the dual graph G* of the triangulation graph, the fourth endpoint set V*={V1, V2, V3, ..., Vn}, where V1 is the vertex subset of the first triangle in the triangulation graph.
[0055] It should be noted that in the embodiment of the present disclosure, new edges may be added during the triangulation of the first endpoint set in the undirected graph to be processed. Since these newly added edges are not the edges in the original geometry file of the target aircraft engine to be analyzed, these newly added edges need to be removed during the process of determining the multi-connected surface domain to ensure the accuracy of the multi-connected surface domain finally determined.
[0056] In an optional implementation, before determining the multi-connected surface domain information set based on the connected components in the dual graph, the terminal device may also: compare the second line segment set in the triangulated graph with the first line segment set in the undirected graph to be processed, and determine the target edge that exists in the second line segment set but does not exist in the first line segment set as the newly added edge. The newly added edge in the triangulated graph obtained after the first endpoint set in the undirected graph to be processed is identified to ensure the accuracy of the multi-connected surface domain information set determined when a new edge is added during the triangulation process of the first endpoint set in the undirected graph to be processed.
[0057] For example, the terminal device reads the first line segment set E from the undirected graph G to be processed, and reads the second line segment set E2 from the triangulation graph T; further, traverses each edge e2 in the second line segment set E2, if e2 does not exist in the first line segment set E, then e2 is a newly added edge.
[0058] In an optional implementation, when it is determined that there are newly added edges in the second line segment set of the triangulated graph, the process of determining the multi-connected surface domain information set according to the multiple connected components in the dual graph by the terminal device includes: determining the multiple connected components in the dual graph; then, connecting the multiple endpoints associated with each connected component in sequence, and filtering the endpoints associated with the newly added edges among the multiple endpoints until a closed boundary is formed, and obtaining the multi-connected surface domain corresponding to each connected component; further, combining the information of the multi-connected surface domain corresponding to each connected component to obtain the multi-connected surface domain information set. When a new edge is added during the triangulation process of the first endpoint set in the undirected graph to be processed, the endpoints of the newly added edge can be removed during the process of determining the multi-connected surface domain information set to ensure the accuracy and reliability of the determined two-dimensional multi-connected surface domain of the aircraft engine.
[0059] In an optional embodiment, the process of determining a multi-connected surface domain information set by a terminal device based on multiple connected components in the dual graph may include: determining multiple connected components in the dual graph; then, connecting multiple endpoints associated with each connected component in sequence until a closed boundary is formed to obtain a multi-connected surface domain corresponding to each connected component; further combining the information of the multi-connected surface domain corresponding to each connected component to obtain a multi-connected surface domain information set; and directly connecting multiple endpoints associated with each connected component without adding new edges during the triangulation process of the first endpoint set in the undirected graph to be processed, so as to quickly determine the two-dimensional multi-connected surface domain of the aircraft engine.
[0060] Among them, the process of the terminal device determining the multiple connected components in the dual graph can be implemented based on the depth-first traversal algorithm, breadth-first search or union-find operation in graph theory, and the embodiments of the present disclosure are not limited to this.
[0061] For example, the process of the terminal device determining multiple connected components in the dual graph based on the depth-first traversal algorithm can be: Components(G*) = {C1, C2, C3…, Ck}, wherein the connected components in the dual graph determined by the terminal device based on the depth-first traversal algorithm include k.
[0062] In an optional implementation, the process of combining the information of the multi-connected surface domains corresponding to each connected component by the terminal device to obtain the multi-connected surface domain information set may include: determining the endpoint coordinates of the multi-connected surface domains corresponding to each connected component, the multi-connected surface domain identifier, and the multi-connected surface domain geometric boundaries and attribute information as the feature information of the multi-connected surface domains corresponding to each connected component. The endpoint coordinates, the multi-connected surface domain identifier, and the multi-connected surface domain geometric boundaries and attribute information constituting the multi-connected surface domain may be determined as the features of the multi-connected surface domain, so that the terminal device can more accurately characterize the features of the multi-connected surface domain.
[0063] Among them, the attribute information of the multi-connected surface area may include color information and / or grayscale information of the multi-connected surface area.
[0064] In an optional implementation, after the terminal device determines the multi-connected surface area information set, it can display the two-dimensional multi-connected surface area based on the characteristic information of each multi-connected surface area in the multi-connected surface area information set, so that the user can more intuitively view the multiple multi-connected surface areas in the two-dimensional digital model of the target aircraft engine, facilitate the subsequent dynamics, statics analysis and other analysis processes, and improve the analysis efficiency in the early stage of aircraft engine design.
[0065] For example, Figure 3 As shown, Figure 3 It shows that based on Figure 2 A schematic diagram of multiple multi-connected surface areas determined by the two-dimensional geometric figure of the aircraft engine shown in FIG. Figure 3 In the diagram, different multi-connected areas are identified by different colors.
[0066] For example, Figure 4 As shown, Figure 4 A flowchart of a two-dimensional multi-connected surface area construction method provided by an embodiment of the present disclosure is shown, including:
[0067] Step S401, obtaining a geometric figure file of a target aircraft engine to be analyzed;
[0068] Step S402, constructing an undirected graph to be processed based on the geometric feature data in the geometric graphics file;
[0069] Step S403, identifying all target endpoints whose degrees are preset values in the undirected graph to be processed; and deleting the target endpoints in the undirected graph to be processed, and the edges associated with the target endpoints, to obtain a first updated undirected graph;
[0070] Step S404, determining the shortest path length of each edge in the first updated undirected graph; and deleting the edge whose shortest path length is a preset length, to obtain a second updated undirected graph;
[0071] Step S405, determining the second updated undirected graph as the undirected graph to be processed, determining the sixth endpoint set in the second updated undirected graph as the first endpoint set, and performing triangulation processing on the first endpoint set in the undirected graph to be processed to obtain a triangulated graph;
[0072] Step S406, comparing the second line segment set in the triangulated graph with the first line segment set in the undirected graph to be processed, and determining the target edges that exist in the second line segment set but do not exist in the first line segment set as newly added edges;
[0073] Step S407, determining multiple connected components in the dual graph, and connecting multiple endpoints associated with each connected component in sequence, and at the same time, filtering the endpoints associated with the newly added edges among the multiple endpoints until a closed boundary is formed, thereby obtaining a multi-connected surface area corresponding to each connected component;
[0074] Step S408, determining the endpoint coordinates of the multi-connected surface areas corresponding to each connected component, the multi-connected surface area identifier, and the multi-connected surface area geometric boundaries and attribute information as feature information of the multi-connected surface areas corresponding to each connected component;
[0075] Step S409: feature information of each multi-connected surface area, displaying the two-dimensional multi-connected surface area.
[0076] An exemplary embodiment of the present disclosure provides a two-dimensional multi-connectivity domain construction device, which may be a terminal device or a chip applied to a terminal device. Figure 5 FIG. 1 shows a schematic block diagram of functional modules of a two-dimensional multi-connected surface domain construction device according to an exemplary embodiment of the present disclosure. Figure 5 As shown, the two-dimensional multi-connected surface area construction device 500 includes:
[0077] An acquisition module 501 is configured to acquire a geometric file of a target aircraft engine to be analyzed;
[0078] The first processing module 502 is configured to construct an undirected graph to be processed based on the geometric feature data in the geometric figure file, and perform triangulation processing on the first endpoint set in the undirected graph to be processed to obtain a triangulation graph;
[0079] The second processing module 503 is configured to construct a dual graph of the triangulation graph, and determine a multi-connected surface region information set according to a plurality of connected components in the dual graph.
[0080] Optional, such as Figure 5 As shown, the apparatus further includes a deletion module 504 configured to:
[0081] Identify all target endpoints in the undirected graph to be processed whose degrees are preset values, wherein the preset value is 1;
[0082] The target endpoint and the edge associated with the target endpoint in the undirected graph to be processed are deleted to obtain a first updated undirected graph.
[0083] Optionally, the deleting module 504 is further configured to:
[0084] Determine the shortest path length of each edge in the first updated undirected graph;
[0085] Delete the edges whose shortest path length is a preset length to obtain a second updated undirected graph, where the preset length is 1.
[0086] Optionally, the apparatus further includes a determining module 505 configured to:
[0087] The second line segment set in the triangulated graph is compared with the first line segment set in the undirected graph to be processed, and target edges that exist in the second line segment set but do not exist in the first line segment set are determined as newly added edges.
[0088] Optionally, the second processing module 503 is configured to:
[0089] determining a plurality of connected components in the dual graph;
[0090] Connecting multiple endpoints associated with each connected component in sequence, and filtering endpoints associated with the newly added edge among the multiple endpoints until a closed boundary is formed, thereby obtaining a multi-connected surface area corresponding to each connected component;
[0091] The feature information of the multi-connected surface domain corresponding to each connected component is determined, and the feature information of multiple multi-connected surface domains is combined to obtain a multi-connected surface domain information set.
[0092] Optionally, the second processing module 503 is configured to:
[0093] The endpoint coordinates of the multi-connected surface domains corresponding to each connected component, the multi-connected surface domain identifiers, and the multi-connected surface domain geometric boundaries and attribute information are determined as feature information of the multi-connected surface domains corresponding to each connected component.
[0094] Optionally, the first processing module 502 is configured to:
[0095] Based on the line parameters in the geometric feature data, construct a space graph to be processed;
[0096] If the spatial graph to be processed is a directed graph, the spatial graph to be processed is converted into an undirected graph to obtain an undirected graph to be processed.
[0097] The exemplary embodiment of the present disclosure also provides an electronic device, comprising: at least one processor; and a memory connected to the at least one processor in communication. The memory stores a computer program that can be executed by the at least one processor, and the computer program is used to cause the electronic device to perform the method according to the embodiment of the present disclosure when executed by the at least one processor.
[0098] The exemplary embodiments of the present disclosure also provide a non-transitory computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor of a computer, is used to cause the computer to perform the method according to the embodiments of the present disclosure.
[0099] like Figure 6 As shown, the exemplary embodiment of the present disclosure further provides a computer program product 600, including a computer program 601, wherein when the computer program is executed by a processor of a computer, it is used to enable the computer to perform the method according to the embodiment of the present disclosure.
[0100] refer to Figure 7 , a block diagram of an electronic device 700 that can be used as a terminal device of the present disclosure will now be described, which is an example of a hardware device that can be applied to various aspects of the present disclosure. The electronic device is intended to represent various forms of digital electronic computer devices, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples, and are not intended to limit the implementation of the present disclosure described and / or required herein.
[0101] like Figure 7As shown, the electronic device 700 includes a computing unit 701, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 702 or a computer program loaded from a storage unit 708 into a random access memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the electronic device 700 can also be stored. The computing unit 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input / output (I / O) interface 705 is also connected to the bus 704.
[0102] A plurality of components in the electronic device 700 are connected to the I / O interface 705, including: an input unit 706, an output unit 707, a storage unit 708, and a communication unit 709. The input unit 706 may be any type of device capable of inputting information to the electronic device 700, and the input unit 706 may receive input digital or character information, and generate key signal inputs related to user settings and / or function control of the electronic device. The output unit 707 may be any type of device capable of presenting information, and may include but is not limited to a display, a speaker, a video / audio output terminal, a vibrator, and / or a printer. The storage unit 708 may include but is not limited to a disk, an optical disk. The communication unit 709 allows the electronic device 700 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks, and may include but is not limited to a modem, a network card, an infrared communication device, a wireless communication transceiver, and / or a chipset, such as a Bluetooth™ device, a WiFi device, a WiMax device, a cellular communication device, and / or the like.
[0103] The computing unit 701 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 701 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 701 performs the various methods and processes described above. For example, in some embodiments, the method of the embodiment of the present disclosure may be implemented as a computer software program, which is tangibly included in a machine-readable medium, such as a storage unit 708. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 700 via the ROM 702 and / or the communication unit 709. In some embodiments, the computing unit 701 may be configured to perform the method of the embodiment of the present disclosure by any other appropriate means (e.g., by means of firmware).
[0104] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.
[0105] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
[0106] As used in this disclosure, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and / or device (e.g., disk, optical disk, memory, programmable logic device (PLD)) for providing machine instructions and / or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal for providing machine instructions and / or data to a programmable processor.
[0107] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).
[0108] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.
[0109] A computer system may include clients and servers. Clients and servers are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship to each other.
[0110] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented by software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instruction is loaded and executed on a computer, the process or function described in the embodiment of the present disclosure is executed in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a terminal, a user device or other programmable device. The computer program or instruction may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer program or instruction may be transmitted from one website site, computer, server or data center to another website site, computer, server or data center by wired or wireless means. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server, data center, etc. that integrates one or more available media. The available medium may be a magnetic medium, for example, a floppy disk, a hard disk, a tape; it may also be an optical medium, for example, a digital video disc (DVD); it may also be a semiconductor medium, for example, a solid state drive (SSD).
[0111] Although the present disclosure has been described in conjunction with specific features and embodiments thereof, it is apparent that various modifications and combinations may be made thereto without departing from the spirit and scope of the present disclosure. Accordingly, this specification and the drawings are merely exemplary illustrations of the present disclosure as defined by the appended claims, and are deemed to have covered any and all modifications, variations, combinations or equivalents within the scope of the present disclosure. Obviously, those skilled in the art may make various modifications and variations to the present disclosure without departing from the spirit and scope of the present disclosure. Thus, if these modifications and variations of the present disclosure fall within the scope of the claims of the present disclosure and their equivalents, the present disclosure is also intended to include these modifications and variations.
Claims
1. A two-dimensional multi-connected surface area construction method, characterized in that: include: Obtaining a geometric file of a target aircraft engine to be analyzed; Based on the geometric feature data in the geometric figure file, construct an undirected graph to be processed, and perform triangulation processing on the first endpoint set in the undirected graph to be processed to obtain a triangulated graph; A dual graph of the triangulation graph is constructed, and a multi-connected surface domain information set is determined according to a plurality of connected components in the dual graph.
2. The method for constructing a two-dimensional multi-connected surface area according to claim 1, characterized in that: Before performing triangulation processing on the endpoint information in the undirected graph to be processed to obtain a triangulation graph, the method further includes: Identify all target endpoints in the undirected graph to be processed whose degrees are preset values, wherein the preset value is 1; The target endpoint and the edge associated with the target endpoint in the undirected graph to be processed are deleted to obtain a first updated undirected graph.
3. The method for constructing a two-dimensional multi-connected surface area according to claim 1, characterized in that: The method further comprises: Determine the shortest path length of each edge in the first updated undirected graph; Delete the edges whose shortest path length is a preset length to obtain a second updated undirected graph, where the preset length is 1.
4. The method for constructing a two-dimensional multi-connected surface area according to claim 1, characterized in that: Before determining the multi-connected surface domain information set according to the connected components in the dual graph, the method further includes: The second line segment set in the triangulated graph is compared with the first line segment set in the undirected graph to be processed, and target edges that exist in the second line segment set but do not exist in the first line segment set are determined as newly added edges.
5. The method for constructing a two-dimensional multi-connected surface area according to claim 4, characterized in that: The step of determining a multi-connected surface domain information set according to a plurality of connected components in the dual graph comprises: determining a plurality of connected components in the dual graph; Connecting multiple endpoints associated with each connected component in sequence, and filtering endpoints associated with the newly added edge among the multiple endpoints until a closed boundary is formed, thereby obtaining a multi-connected surface area corresponding to each connected component; The feature information of the multi-connected surface domain corresponding to each connected component is determined, and the feature information of multiple multi-connected surface domains is combined to obtain a multi-connected surface domain information set.
6. The method for constructing a two-dimensional multi-connected surface area according to claim 4, characterized in that: The determining of feature information of the multi-connected surface area corresponding to each connected component includes: The endpoint coordinates of the multi-connected surface domains corresponding to each connected component, the multi-connected surface domain identifiers, and the multi-connected surface domain geometric boundaries and attribute information are determined as feature information of the multi-connected surface domains corresponding to each connected component.
7. The method for constructing a two-dimensional multi-connected surface area according to claim 1, characterized in that: The step of constructing an undirected graph to be processed based on the geometric feature data in the geometric graphics file includes: Based on the line parameters in the geometric feature data, construct a space graph to be processed; If the spatial graph to be processed is a directed graph, the spatial graph to be processed is converted into an undirected graph to obtain an undirected graph to be processed.
8. A two-dimensional multi-connected surface area construction device, characterized in that: include: An acquisition module is configured to acquire a geometric file of a target aircraft engine to be analyzed; A first processing module is configured to construct an undirected graph to be processed based on the geometric feature data in the geometric figure file, and perform triangulation processing on a first endpoint set in the undirected graph to be processed to obtain a triangulation graph; The second processing module is configured to construct a dual graph of the triangulation graph, and determine a multi-connected surface domain information set according to a plurality of connected components in the dual graph.
9. An electronic device comprising a memory, a processor and a computer program stored in the memory, characterized in that: The processor executes the computer program to implement the two-dimensional multi-connected surface area construction device described in any one of claims 1 to 7.
10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the two-dimensional multi-connected surface area construction device described in any one of claims 1 to 7 is implemented.
Citation Information
Cited By
Geometric model processing method for airflow organization simulation
CN121683301A