CN117010252A - Method and device for matching coarse and fine grid cells in finite element model - Google Patents
Method and device for matching coarse and fine grid cells in finite element model Download PDFInfo
- Publication number
- CN117010252A CN117010252A CN202311001664.5A CN202311001664A CN117010252A CN 117010252 A CN117010252 A CN 117010252A CN 202311001664 A CN202311001664 A CN 202311001664A CN 117010252 A CN117010252 A CN 117010252A
- Authority
- CN
- China
- Prior art keywords
- matched
- unit
- units
- group
- unmatched
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000004891 communication Methods 0.000 claims abstract description 30
- 239000013598 vector Substances 0.000 claims description 68
- 238000013507 mapping Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 8
- 210000004027 cell Anatomy 0.000 description 77
- 238000005452 bending Methods 0.000 description 10
- 238000004458 analytical method Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 6
- 238000004364 calculation method Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000010365 information processing Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 210000003888 boundary cell Anatomy 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
- G06F30/23—Design optimisation, verification or simulation using finite element methods [FEM] or finite difference methods [FDM]
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a method and a device for matching coarse and fine grid cells in a finite element model. The matching method comprises the following steps: obtaining unmatched units in the finite element model; selecting any unit from the unmatched units as a unit to be matched, searching unmatched units and matched units adjacent to the unit to be matched, and forming a communication group by the unit to be matched and the unmatched units adjacent to the unit to be matched; determining the type of the connected group according to the adjacent matched units of the connected group, wherein the type of the connected group comprises: an extension group and an extension group; and matching corresponding coarse grid cells for the cells to be matched according to the type of the connected group. The application can realize the comprehensive matching of the fine grid cells and the coarse grid cells in the fine grid model, and solves the problem that the fine grid cells cannot be completely matched with the coarse grid cells due to the different shapes of the fine grid model and the coarse grid model.
Description
Technical Field
The application relates to the technical field of finite element model analysis, in particular to a method and a device for matching coarse and fine grid cells in a finite element model.
Background
In a finite element model, the accuracy of the model analysis is directly related to the finite element mesh used. The finite element mesh segments the CAD model into a number of cells on which the analysis is performed. With the continuous refinement of the grid, the units become smaller and smaller, so that the solution result of the model analysis is closer and closer to the real solution.
In the model analysis, after the solution is completed based on the coarse grid, the grid refinement is started. Grid refinement is, in short, a process of parsing a model with a continuously refined grid and comparing results obtained under different grids. The result comparison may be achieved by analyzing the physical field at one or more points in the model, or by integrating some physical field over some domain or boundary.
The coarse and fine grids need to be mapped in the grid refinement process, however, the current coarse and fine grid mapping can only be matched with coarse and fine grids expressing the same geometric shape, and the models with the geometric shapes different cannot be completely matched. For example, there are fine meshes of press-bending corners, and since the fine meshes describe the actual geometry and the coarse meshes are simplified meshes, the simplified description of the geometry is largely different from the actual geometry, and thus the coarse-fine mesh mapping of press-bending corners cannot be achieved.
Disclosure of Invention
In order to solve at least one technical problem in the prior art, the embodiment of the application provides a method and a device for matching thick and thin grid cells in a finite element model. The technical scheme is as follows:
in a first aspect, a method for matching coarse and fine grid cells in a finite element model is provided, including:
obtaining unmatched units in a finite element model, wherein the unmatched units are fine grid units in the finite element model, and a mapping relation between the fine grid units and coarse grid units cannot be established;
selecting any unit from unmatched units as a unit to be matched, searching unmatched units and matched units adjacent to the unit to be matched, forming a communication group by the unit to be matched and the unmatched units adjacent to the unit to be matched, wherein the matched units adjacent to the unit to be matched are adjacent matched units of the communication group;
determining the type of the connected group according to the adjacent matched units of the connected group, wherein the type of the connected group comprises: an extension group and an extension group;
and matching the corresponding coarse grid cells for the cells to be matched according to the type of the connected group.
Further, the searching for the unmatched unit and the matched unit adjacent to the unit to be matched includes:
grouping unmatched units according to normal vectors of unmatched units in the finite element model;
selecting any unmatched unit in a unit group as the unit to be matched, and searching unmatched units and matched units adjacent to the unit to be matched;
and adding the searched unmatched units adjacent to the unit to be matched into the connected group and deleting the unmatched units from the unit group.
Further, the grouping of the unmatched units according to the normal vector of each unmatched unit in the finite element model includes:
calculating normal vectors of unmatched units;
and if the angle difference of the normal vectors of the unmatched units in the same coordinate system meets the same group threshold value, determining that the unmatched units are the same unit group.
Further, the determining the type of the connected group according to the adjacent matched units of the connected group includes:
calculating the normal vector of each adjacent matched unit in the connected group;
if the angle difference between the normal vector of the adjacent matched unit and the normal vector of any unmatched unit in the communication group accords with an angle threshold of an extension group, the communication group is the extension group;
if the included angle between the normal vector of the adjacent matched unit and the normal vector of any unmatched unit in the connected group accords with the angle threshold of the extended group, the connected group is the extended group.
Further, the determining of the extending group angle threshold includes:
calculating the distance between the centroid of the unmatched unit and the centroid of the adjacent matched unit;
the extending group angle threshold alpha is:where S is the distance between the centroid of an unmatched cell and the centroid of an adjacent matched cell and R is the minimum radius of curvature.
Further, the matching the coarse grid unit for the unit to be matched according to the type of the connected group includes:
determining matched boundary units with common edges with the units to be matched in the extension group;
and calculating the distance between the unit to be matched and the matched boundary unit in the extension group, and determining the coarse grid unit corresponding to the matched boundary unit with the minimum distance as the coarse grid unit matched with the unit to be matched.
Further, the matching the coarse grid unit for the unit to be matched according to the type of the connected group includes:
and calculating a normal vector passing through the centroid of the unit to be matched in the extension group, wherein in coarse grid units in which the normal vector is intersected with the normal vector of the unit to be matched, the coarse grid unit with the smallest centroid distance between the intersection point and the unit to be matched is the coarse grid unit matched with the unit to be matched in the extension group.
In a second aspect, there is provided a matching apparatus for coarse and fine grid cells in a finite element model, including:
the unit acquisition module is used for acquiring unmatched units in the finite element model, wherein the unmatched units are fine grid units which do not establish a mapping relation with coarse grid units in the finite element model;
the unit searching module is used for selecting any unit from the unmatched units as a unit to be matched, searching unmatched units and matched units adjacent to the unit to be matched, forming a communication group by the unit to be matched and the unmatched units adjacent to the unit to be matched, and forming adjacent matched units adjacent to the unit to be matched, wherein the adjacent matched units of the communication group are not in the communication group;
a type determining module, configured to determine a type of the connected group according to the adjacent matched units of the connected group, where the type of the connected group includes: an extension group and an extension group;
and the matching module is used for matching the to-be-matched units with corresponding coarse grid units according to the type of the connected group.
Further, the unit search module includes:
the grouping module is used for grouping the unmatched units according to the normal vectors of the unmatched units in the finite element model;
the searching module is used for selecting any unmatched unit in a unit group as the unit to be matched and searching unmatched units and matched units adjacent to the unit to be matched;
and adding the searched unmatched units adjacent to the unit to be matched into the communication group and deleting the unmatched units from the unit group.
Further, the grouping module is specifically configured to:
a normal vector for calculating unmatched units;
and if the angle difference of the normal vectors of the unmatched units in the same coordinate system meets the same group threshold value, determining that the unmatched units are the same unit group.
Further, the type determining module includes:
the calculation module is used for calculating the normal vector of each adjacent matched unit in the communication group;
the extension group determining module is used for determining that the connected group is the extension group if the angle difference between the normal vector of the adjacent matched unit and the normal vector of any unmatched unit in the connected group accords with an extension group angle threshold;
and the extension group determining module is used for determining that the connected group is the extension group if the included angle between the normal vector of the adjacent matched unit and the normal vector of any unmatched unit in the connected group accords with the angle threshold of the extension group.
Further, the type determining module further includes:
the extension group angle threshold determining module is specifically configured to:
calculating the distance between the centroid of the unmatched unit and the centroid of the adjacent matched unit;
the extending group angle threshold alpha is:where S is the distance between the centroid of an unmatched cell and the centroid of an adjacent matched cell and R is the minimum radius of curvature.
Further, the matching module includes:
the extension group unit matching module is specifically used for:
determining matched boundary units with common edges with the units to be matched in the extension group;
and calculating the distance between the unit to be matched and the matched boundary unit in the extension group, and determining the coarse grid unit corresponding to the matched boundary unit with the minimum distance as the coarse grid unit matched with the unit to be matched.
Further, the matching module includes:
the extension group unit matching module is specifically configured to:
and calculating a normal vector passing through the centroid of the unit to be matched in the extension group, wherein in coarse grid units in which the normal vector is intersected with the normal vector of the unit to be matched, the coarse grid unit with the smallest centroid distance between the intersection point and the unit to be matched is the coarse grid unit matched with the unit to be matched in the extension group.
In a third aspect, an electronic device is provided, comprising:
one or more processors; and
a memory associated with the one or more processors, the memory for storing program instructions that, when read for execution by the one or more processors, perform the method of any of the first aspects.
In a fourth aspect, there is provided a computer readable medium having stored thereon a computer program, wherein the program when executed by a processor implements the method according to any of the first aspects.
The technical scheme provided by the embodiment of the application has the beneficial effects that:
according to the technical scheme disclosed by the embodiment of the application, the unmatched units in the finite element model are subjected to grouping processing, the types of the connected groups are determined, the position relation between the unmatched units and the matched units are found, the unmatched units with different position relations are respectively matched with the coarse grid units, the fine grid units and the coarse grid units in the fine grid model can be comprehensively matched, and the problem that the fine grid units cannot be completely matched with the coarse grid units due to different shapes of the fine grid model and the coarse grid model is solved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a coarse mesh model with press-bending corners provided by an embodiment of the present application;
FIG. 2 is a fine mesh model with press-bending corners provided by an embodiment of the present application;
FIG. 3 is a flowchart of a method for matching coarse and fine grid cells in a finite element model according to an embodiment of the present application;
FIG. 4 is a schematic diagram of a matched boundary cell provided by an embodiment of the present application;
fig. 5 is a schematic structural diagram of a matching device for coarse and fine grid cells in a finite element model according to an embodiment of the present application.
Fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present application more apparent, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
As described in the background, current coarse-fine grid mappings can only match coarse-fine grids that express the same geometry. The refined grid describes the actual geometric shape, the coarse grid is only a simplified grid, the geometric shape is a simplified description, and the geometric shape is greatly different from the actual geometric shape, so that the model shape expressed by the fine grid is inconsistent with the model shape expressed by the coarse grid, and the fine grid cannot be matched with the coarse grid corresponding to the fine grid. For example, a finite element analysis model using a panel with a press-bent-type corner is shown in fig. 1 and 2, the model in fig. 1 being expressed in a coarse mesh, and the model in fig. 2 being expressed in a coarse mesh. As can be seen by comparing fig. 1 and fig. 2, the panel model expressed by the coarse mesh in fig. 1 cannot express the bending curvature of the bending angle at the bending angle where the inner bottom plate 1 and the bilge plate 2 are connected, and it is apparent from fig. 2 that there is a certain bending curvature at the bending angle. And the web of the model in fig. 2 (solid rib 3, bottom stringer 4, etc.) is extended by a portion relative to the web of the model in fig. 1 due to the mesh refinement. The comparison of fig. 1 and fig. 2 shows that the fine mesh model and the coarse mesh model have different model expression shapes, so that the fine mesh unit is easy to be not matched with the corresponding coarse mesh unit in the mesh unit matching process.
In order to solve the technical problems, the embodiment of the application discloses a method and a device for matching coarse and fine grid cells in a finite element model, and the specific technical scheme is as follows:
as shown in fig. 3, a method for matching coarse and fine grid cells in a finite element model includes:
s1, obtaining unmatched units in a finite element model, wherein the unmatched units are fine grid units in the finite element model, and the mapping relation between the fine grid units and a coarse grid monocular cannot be established.
In the above-mentioned cell matching of the finite element model, the normal matching of the cell means that the fine grid cell and the coarse grid cell are located on the same plane, and the centroid of the fine grid cell is located within the range of the corresponding coarse grid cell, and the coarse grid cell is considered as the parent cell of the fine grid cell, and the fine grid cell and the coarse grid cell have the same attribute. The unmatched cells refer to fine grid cells where the corresponding coarse grid cells cannot be found after the normal matching procedure. The matched cells refer to fine grid cells which can find corresponding coarse grid cells after being processed by a normal matching program.
S2, selecting any unit from the unmatched units as a unit to be matched, searching unmatched units and matched units adjacent to the unit to be matched, forming a communication group by the unit to be matched and the unmatched units adjacent to the unit to be matched, and taking the matched units adjacent to the unit to be matched as adjacent matched units of the communication group.
As described above, adjacent cells refer to cells having a common edge. All units included in the connected group are unmatched units, and adjacent matched units in the connected group are matched units with adjacent relation with units in the connected group.
In one embodiment, searching for unmatched units and matched units adjacent to the unit to be matched in step S2 includes:
grouping unmatched units according to normal vectors of unmatched units in the finite element model;
selecting any unmatched unit in a unit group as a unit to be matched, and searching unmatched units and matched units adjacent to the unit to be matched;
and adding the searched unmatched units adjacent to the unit to be matched into the connected group and deleting the unmatched units from the unit group.
The set of cells refers to a preliminary grouping of all unmatched cells in the finite element model. Through the steps, the connected group gradually increases the units to be matched and the unmatched units adjacent to the band matching units in the searching process.
In one embodiment, grouping the unmatched units according to normal vectors of the unmatched units in the finite element model includes:
calculating normal vectors of unmatched units;
and if the angle difference of the normal vectors of the unmatched units in the same coordinate system meets the same group threshold value, determining that the unmatched units are not in the same unit group.
The same set of thresholds may be set as desired, for example, the normal vectors of the unmatched units within the same set may differ by no more than 0.5 °.
S3, determining the type of the connected group according to the adjacent matched units of the connected group, wherein the type of the connected group comprises: an extension group and an extension group.
The extension group comprises the units to be matched and the extension units of the units to be matched. Extension units mean that two fine grid cells with common sides have normal vectors with similar directions, wherein the normal vectors with similar directions refer to normal vector angles A ε 0+ -0.5 DEG or 180+ -0.5 deg. The extension group comprises extension units of units to be matched. Extension cells refer to two fine grid cells with a common edge having normal vectors that are not in close orientation. It can be seen that the extension units represent extension connection relations between units which are close to the same plane, and the extension units represent bending connection relations between units which are not in the same plane.
In one embodiment, step S3 includes:
calculating the normal vector of each adjacent matched unit in the connected group;
if the angle difference between the normal vector of the adjacent matched unit and the normal vector of any unmatched unit in the communication group accords with the angle threshold value of the extension group, the communication group is the extension group;
if the included angle between the normal vector of the adjacent matched unit and the normal vector of any unmatched unit in the communicating group accords with the angle threshold of the extending group, the communicating group is the extending group.
The extending group angle threshold may be selected to be a e 0 + 0.5 deg. or 180 + 0.5 deg.. The spread group angle threshold is related to centroid distance of adjacent cells.
In one embodiment, the determination of the extension group angle threshold includes:
calculating the distance between the centroid of the unmatched unit and the centroid of the adjacent matched unit;
the extension group angle threshold α is:where S is the distance between the centroid of an unmatched cell and the centroid of an adjacent matched cell and R is the minimum radius of curvature.
The minimum curvature radius R may be set to 300 ° by default, or may be set manually, and the minimum curvature radius set manually takes r=0.75 x user filling value during calculation.
S4, matching the corresponding coarse grid cells for the cells to be matched according to the type of the connected group.
The set of grid cells are matched by different methods for the extension set and the extension set, respectively. Cell matching of the extension set is determined based on the distance between the cells. The unit matching of the extension group is determined by adopting a normal vector intersection method.
In one embodiment, step S4 includes:
and determining matched boundary units with common edges with units to be matched in the extension group.
And calculating the distance between the unit to be matched and the matched boundary unit in the extension group, and determining the coarse grid unit corresponding to the matched boundary unit with the minimum distance as the coarse grid unit matched with the unit to be matched.
As shown in fig. 4, the region a is an unmatched unit, the region B is a matched unit, and the unit closest to the region a is a matched boundary unit, that is, the matched boundary unit is a matched unit having a common edge with the unit to be matched. And for the extension group, the mapping relation is indirectly determined for the units to be matched through the matched units of the determined mapping relation. The method disclosed by the embodiment of the application can be used for matching the coarse grid cells for the cells with the extension relation.
In one embodiment, step S4 includes:
and calculating the normal vector passing through the centroid of the unit to be matched in the extension group, wherein the coarse grid unit with the smallest centroid distance between the intersection point and the unit to be matched is the coarse grid unit matched with the unit to be matched in the extension group in the coarse grid unit with the intersection point intersecting with the normal vector of the unit to be matched.
Since the cells in the extension group are not on one plane, the coarse grid cell closest to the cell to be matched is determined by comparing the distances from the intersection point of the normal vector to the centroid. And determining the coarse grid cells corresponding to the units to be matched according to the direct position relation between the units to be matched and the coarse grid cells in the fine grid cell model for the extension group. The method disclosed by the embodiment of the application can be used for matching the coarse grid cells for the cells with the extension relation.
As shown in fig. 5, based on the above method for matching coarse and fine grid cells in a finite element model disclosed in the present application, the present application further provides a device for matching coarse and fine grid cells in a finite element model, including:
the unit obtaining module 501 is configured to obtain an unmatched unit in the finite element model, where the unmatched unit is a fine grid unit in the finite element model, and the fine grid unit does not establish a mapping relationship with a coarse grid unit.
The unmatched cells refer to fine grid cells where the corresponding coarse grid cells cannot be found after the normal matching process. The matched cells refer to fine grid cells which can find corresponding coarse grid cells after being processed by a normal matching program.
The unit searching module 502 is configured to select any unit from the unmatched units as a unit to be matched, search for an unmatched unit and a matched unit adjacent to the unit to be matched, and group the unit to be matched and the unmatched unit adjacent to the unit to be matched into a connected group, and adjacent matched units adjacent to the unit to be matched in the unmatched group of matched units.
As described above, adjacent cells refer to cells having a common edge. All units included in the connected group are unmatched units.
In one embodiment, unit search module 502 includes:
the grouping module is used for grouping the unmatched units according to normal vectors of the unmatched units in the finite element model;
the searching module is used for selecting any unmatched unit in a unit group as a unit to be matched and searching unmatched units and matched units adjacent to the unit to be matched;
and adding the searched unmatched units adjacent to the unit to be matched into the connected group and deleting the unmatched units from the unit group.
In one embodiment, the grouping module is specifically configured to:
a normal vector for calculating unmatched units;
and if the angle difference of the normal vectors of the unmatched units in the same coordinate system meets the same group threshold value, determining that the unmatched units are the same unit group.
The same group of thresholds may be set as desired, e.g. the normal vectors of the unmatched units within the same group differ by no more than 0.5 °
A type determining module 503, configured to determine a type of a connected group according to the adjacent matched units of the connected group, where the type of the connected group includes: an extension group and an extension group.
The extension group comprises the units to be matched and the extension units of the units to be matched. Extension units mean that two fine grid cells with common sides have normal vectors with similar directions, wherein the normal vectors with similar directions refer to normal vector angles A ε 0+ -0.5 DEG or 180+ -0.5 deg. The extension group comprises extension units of units to be matched. Extension cells refer to two fine grid cells with a common edge having normal vectors that are not in close orientation.
In one embodiment, the type determination module 503 includes:
the calculation module is used for calculating the normal vector of each adjacent matched unit in the connected group;
the extension group determining module is used for determining that the communication group is an extension group if the angle difference between the normal vector of the adjacent matched unit and the normal vector of any unmatched unit in the communication group accords with the angle threshold of the extension group;
the extension group determining module is used for determining that the connected group is an extension group if the included angle between the normal vector of the adjacent matched unit and the normal vector of any unmatched unit in the connected group accords with the angle threshold of the extension group.
The extending group angle threshold may be selected to be a e 0 + 0.5 deg. or 180 + 0.5 deg.. The spread group angle threshold is related to centroid distance of adjacent cells.
In one embodiment, the type determination module further comprises:
the extension group angle threshold determining module is specifically configured to:
calculating the distance between the centroid of the unmatched unit and the centroid of the adjacent matched unit;
extension group angle threshold alphaThe method comprises the following steps:where S is the distance between the centroid of an unmatched cell and the centroid of an adjacent matched cell and R is the minimum radius of curvature.
And the matching module 504 is configured to match the corresponding coarse grid cells for the cells to be matched according to the type of the connected group.
In one embodiment, the matching module includes:
the extension group unit matching module is specifically used for:
determining matched boundary units with common edges with units to be matched in the extension group;
and calculating the distance between the unit to be matched and the matched boundary unit in the extension group, and determining the coarse grid unit corresponding to the matched boundary unit with the minimum distance as the coarse grid unit matched with the unit to be matched.
In one embodiment, the matching module includes:
the extension group unit matching module is specifically configured to:
and calculating the normal vector passing through the centroid of the unit to be matched in the extension group, wherein the coarse grid unit with the smallest centroid distance between the intersection point and the unit to be matched is the coarse grid unit matched with the unit to be matched in the extension group in the coarse grid unit with the intersection point intersecting with the normal vector of the unit to be matched.
In addition, the embodiment of the application also provides electronic equipment, which comprises:
one or more processors; and
and a memory associated with the one or more processors, the memory configured to store program instructions that, when read for execution by the one or more processors, perform the method of matching coarse and fine grid cells in the finite element model disclosed in the above embodiments.
Fig. 6 illustrates a system architecture of an electronic device, which may include a processor 610, a video display adapter 611, a disk drive 612, an input/output interface 613, a network interface 614, and a memory 620, among others. The processor 610, video display adapter 611, disk drive 612, input/output interface 613, network interface 614, and memory 620 may be communicatively coupled via a communications bus 630.
The processor 610 may be implemented by a general-purpose CPU (Central Processing Unit ), a microprocessor, an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, etc., for executing related programs to implement the technical scheme provided by the present application.
The Memory 620 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), a static storage device, a dynamic storage device, or the like. The memory 620 may store an operating system 621 for controlling the operation of the electronic device, a Basic Input Output System (BIOS) for controlling low-level operation of the electronic device. In addition, a web browser 623, a data storage management system 624, a device identification information processing system 625, and the like may also be stored. The device identification information processing system 625 may be an application program that implements the operations of the foregoing steps in the embodiments of the present application. In general, when the technical solution provided by the present application is implemented by software or firmware, relevant program codes are stored in the memory 620 and invoked by the processor 610 to be executed.
The input/output interface 613 is used to connect with an input/output module to realize information input and output. The input/output module may be configured as a component in a device (not shown) or may be external to the device to provide corresponding functionality. Wherein the input devices may include a keyboard, mouse, touch screen, microphone, various types of sensors, etc., and the output devices may include a display, speaker, vibrator, indicator lights, etc.
The network interface 614 is used to connect communication modules (not shown) to enable communication interactions of the device with other devices. The communication module may implement communication through a wired manner (such as USB, network cable, etc.), or may implement communication through a wireless manner (such as mobile network, WIFI, bluetooth, etc.).
Bus 630 includes a path to transfer information between components of the device (e.g., processor 610, video display adapter 611, disk drive 612, input/output interface 613, network interface 614, and memory 620).
In addition, the electronic device may also obtain information of specific acquisition conditions from the virtual resource object acquisition condition information database, so as to be used for performing condition judgment, and the like.
It should be noted that although the above devices illustrate only the processor 610, video display adapter 611, disk drive 612, input/output interface 613, network interface 614, memory 620, bus 630, etc., the device may include other components necessary to achieve proper operation in an implementation. Furthermore, it will be appreciated by those skilled in the art that the apparatus may include only the components necessary to implement the present application, and not all of the components shown in the drawings.
In particular, according to embodiments of the present application, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present application include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via a communication device, or from memory, or from ROM. The above-described functions defined in the method of the embodiment of the present application are performed when the computer program is executed by a processor.
It should be noted that, the computer readable medium of the embodiments of the present application may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In embodiments of the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in embodiments of the present application, the computer-readable signal medium may comprise a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (Radio Frequency), and the like, or any suitable combination thereof.
The computer readable medium may be contained in the server; or may exist alone without being assembled into the server. The computer readable medium carries one or more programs which, when executed by the server, cause the server to: acquiring a frame rate of an application on the terminal in response to detecting that a peripheral mode of the terminal is not activated; when the frame rate meets the screen-off condition, judging whether the node is acquiring screen information of the terminal; and controlling the screen to enter an immediate dimming mode in response to the judgment result that the node does not acquire the screen information of the terminal.
Computer program code for carrying out operations for embodiments of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the node computer, partly on the node computer, as a stand-alone software package, partly on the node computer and partly on a remote computer or entirely on the remote computer or server. In the case of remote computers, the remote computers can be connected to the node computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or can be connected to external computers (for example, through the Internet using an Internet service provider).
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for a system or system embodiment, since it is substantially similar to a method embodiment, the description is relatively simple, with reference to the description of the method embodiment being made in part. The systems and system embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present application without undue burden.
The foregoing has outlined rather broadly the more detailed description of the application in order that the detailed description of the application that follows may be better understood, and in order that the present principles and embodiments may be better understood; also, it is within the scope of the present application to be modified by those of ordinary skill in the art in light of the present teachings. In view of the foregoing, this description should not be construed as limiting the application.
Any combination of the above optional solutions may be adopted to form an optional embodiment of the present application, which is not described herein.
The foregoing description of the preferred embodiments of the application is not intended to limit the application to the precise form disclosed, and any such modifications, equivalents, and alternatives falling within the spirit and scope of the application are intended to be included within the scope of the application.
Claims (10)
1. A method for matching coarse and fine grid cells in a finite element model, comprising:
obtaining unmatched units in a finite element model, wherein the unmatched units are fine grid units in the finite element model, and a mapping relation between the fine grid units and coarse grid units cannot be established;
selecting any unit from unmatched units as a unit to be matched, searching unmatched units and matched units adjacent to the unit to be matched, forming a communication group by the unit to be matched and the unmatched units adjacent to the unit to be matched, wherein the matched units adjacent to the unit to be matched are adjacent matched units of the communication group;
determining the type of the connected group according to the adjacent matched units of the connected group, wherein the type of the connected group comprises: an extension group and an extension group;
and matching the corresponding coarse grid cells for the cells to be matched according to the type of the connected group.
2. The method of claim 1, wherein the searching for unmatched units and matched units adjacent to the unit to be matched comprises:
grouping unmatched units according to normal vectors of unmatched units in the finite element model;
selecting any unmatched unit in a unit group as the unit to be matched, and searching unmatched units and matched units adjacent to the unit to be matched;
and adding the searched unmatched units adjacent to the unit to be matched into the connected group and deleting the unmatched units from the unit group.
3. The method of claim 2, wherein said grouping unmatched elements according to their normal vectors in said finite element model comprises:
calculating normal vectors of unmatched units;
and if the angle difference of the normal vectors of the unmatched units in the same coordinate system meets the same group threshold value, determining that the unmatched units are the same unit group.
4. The method of claim 1, wherein said determining the type of the connected group from adjacent matched units of the connected group comprises:
calculating the normal vector of each adjacent matched unit in the connected group;
if the angle difference between the normal vector of the adjacent matched unit and the normal vector of any unmatched unit in the communication group accords with an angle threshold of an extension group, the communication group is the extension group;
if the included angle between the normal vector of the adjacent matched unit and the normal vector of any unmatched unit in the connected group accords with the angle threshold of the extended group, the connected group is the extended group.
5. The method of claim 4, wherein the determining of the extension group angle threshold comprises:
calculating the distance between the centroid of the unmatched unit and the centroid of the adjacent matched unit;
the extending group angle threshold alpha is:where S is the distance between the centroid of an unmatched cell and the centroid of an adjacent matched cell and R is the minimum radius of curvature.
6. The method of claim 1, wherein said matching the coarse grid cells for the cells to be matched by the type of the connected group comprises:
determining matched boundary units with common edges with the units to be matched in the extension group;
and calculating the distance between the unit to be matched and the matched boundary unit in the extension group, and determining the coarse grid unit corresponding to the matched boundary unit with the minimum distance as the coarse grid unit matched with the unit to be matched.
7. The method of claim 1, wherein said matching the coarse grid cells for the cells to be matched by the type of the connected group comprises:
and calculating a normal vector passing through the centroid of the unit to be matched in the extension group, wherein in coarse grid units in which the normal vector is intersected with the normal vector of the unit to be matched, the coarse grid unit with the smallest centroid distance between the intersection point and the unit to be matched is the coarse grid unit matched with the unit to be matched in the extension group.
8. A device for matching coarse and fine grid cells in a finite element model, comprising:
the unit acquisition module is used for acquiring unmatched units in the finite element model, wherein the unmatched units are fine grid units which do not establish a mapping relation with coarse grid units in the finite element model;
the unit searching module is used for selecting any unit from the unmatched units as a unit to be matched, searching unmatched units and matched units adjacent to the unit to be matched, forming a communication group by the unit to be matched and the unmatched units adjacent to the unit to be matched, and forming adjacent matched units adjacent to the unit to be matched, wherein the adjacent matched units of the communication group are not in the communication group;
a type determining module, configured to determine a type of the connected group according to the adjacent matched units of the connected group, where the type of the connected group includes: an extension group and an extension group;
and the matching module is used for matching the to-be-matched units with corresponding coarse grid units according to the type of the connected group.
9. An electronic device, comprising:
one or more processors; and
a memory associated with the one or more processors for storing program instructions that, when read for execution by the one or more processors, perform the method of any of claims 1-7.
10. A computer readable medium having stored thereon a computer program, wherein the program when executed by a processor implements the method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311001664.5A CN117010252A (en) | 2023-08-10 | 2023-08-10 | Method and device for matching coarse and fine grid cells in finite element model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311001664.5A CN117010252A (en) | 2023-08-10 | 2023-08-10 | Method and device for matching coarse and fine grid cells in finite element model |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117010252A true CN117010252A (en) | 2023-11-07 |
Family
ID=88572477
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311001664.5A Pending CN117010252A (en) | 2023-08-10 | 2023-08-10 | Method and device for matching coarse and fine grid cells in finite element model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117010252A (en) |
-
2023
- 2023-08-10 CN CN202311001664.5A patent/CN117010252A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110307838B (en) | Robot repositioning method and device, computer-readable storage medium and robot | |
| US10867083B2 (en) | Technique for generating approximate design solutions | |
| EP3910543A2 (en) | Method for training object detection model, object detection method and related apparatus | |
| US8204714B2 (en) | Method and computer program product for finding statistical bounds, corresponding parameter corners, and a probability density function of a performance target for a circuit | |
| CN110910445B (en) | Object size detection method, device, detection equipment and storage medium | |
| CN114993328B (en) | Vehicle positioning evaluation method, device, equipment and computer readable medium | |
| CN115359308A (en) | Model training method, apparatus, device, storage medium, and program for identifying difficult cases | |
| CN113837194A (en) | Image processing method, image processing apparatus, electronic device, and storage medium | |
| CN117010252A (en) | Method and device for matching coarse and fine grid cells in finite element model | |
| CN114723640B (en) | Obstacle information generation method and device, electronic equipment and computer readable medium | |
| CN110110015B (en) | Information point data processing method, processing device and computer readable storage medium | |
| CN113032071B (en) | Page element positioning method, page testing method, device, equipment and medium | |
| CN115127565A (en) | High-precision map data generation method and device, electronic equipment and storage medium | |
| CN113808134A (en) | Oil tank layout information generation method, oil tank layout information generation device, electronic apparatus, and medium | |
| CN109840945B (en) | Finite element preprocessing method and device | |
| CN112966971A (en) | Project workload assessment method and device | |
| CN113723405A (en) | Method and device for determining area outline and electronic equipment | |
| CN113015117A (en) | User positioning method and device, electronic equipment and storage medium | |
| CN112289167A (en) | Positioning method and device, computer readable storage medium and electronic equipment | |
| CN110647519B (en) | Method and device for predicting missing attribute value in test sample | |
| CN113656876B (en) | Automatic cabinet model generation method, device, medium and electronic equipment | |
| CN114694138B (en) | Road surface detection method, device and equipment applied to intelligent driving | |
| US20220230343A1 (en) | Stereo matching method, model training method, relevant electronic devices | |
| CN113038357A (en) | Indoor positioning method and electronic equipment | |
| CN114647709A (en) | Map data processing method and device, electronic equipment and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |