CN110363859B - Spatial mesh model triangulation method for special-shaped curved surface structure - Google Patents
Spatial mesh model triangulation method for special-shaped curved surface structure Download PDFInfo
- Publication number
- CN110363859B CN110363859B CN201910535203.3A CN201910535203A CN110363859B CN 110363859 B CN110363859 B CN 110363859B CN 201910535203 A CN201910535203 A CN 201910535203A CN 110363859 B CN110363859 B CN 110363859B
- Authority
- CN
- China
- Prior art keywords
- grid
- intelligent
- agents
- space
- mesh
- 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.)
- Active
Links
Images
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]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Geometry (AREA)
- General Physics & Mathematics (AREA)
- Computer Graphics (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a space mesh model triangulation method of a special-shaped curved surface structure, which comprises the following steps: acquiring an original space grid model of a special-shaped curved surface structure; inputting an original space grid model in a computer, establishing a Half-Edge data structure according to the model, and determining an initial grid model; presetting the number of target nodes and the unit size, and setting the number of agents and an initial value of a repulsion radius; uniformly distributing intelligent agents in the initial grid model, and adding all the uniformly distributed intelligent agents into a newly-built space grid node list; establishing a new triangulation space grid by taking the space coordinates of the intelligent agent as reference nodes; and if the subdivision grid does not reach the expectation, adjusting the number of the agents and the exclusion radius, and repeating the steps until the generated subdivision grid reaches the expectation to complete triangulation. The invention improves the efficiency of computer modeling work, can adjust the newly-built grid in real time through setting various parameters, and has simple and visual operation.
Description
Technical Field
The invention belongs to the field of mesh model processing, and particularly relates to a space mesh model triangulation method for a special-shaped curved surface structure.
Background
The generation of the finite element mesh is an important research field crossing engineering science and computational science, at present, the subdivision method of the two-dimensional mesh is more perfect, and the two-dimensional mesh can be quickly completed according to design drawings and commercial software; for three-dimensional meshes, regular meshes can be obtained by stretching two-dimensional meshes, and complex meshes can be obtained by automatically subdividing tetrahedral meshes.
At present, the subdivision and reconstruction of a computer grid (Mesh) model are mostly based on the deletion and subdivision of an original grid, the subdivision result is mostly dependent on the characteristics of the original grid model, and the accurate control on the size and the uniformity of a grid model unit is difficult. For a grid model with a high requirement on uniformity, manual modeling is often needed, and a lot of time is consumed.
Disclosure of Invention
The purpose of the invention is as follows: aiming at the problems, the invention provides a triangulation method of a space mesh model of a special-shaped curved surface structure. The method is characterized in that points are uniformly distributed on the surface of an original space grid to serve as vertexes of a newly-built subdivision grid, subdivision units are adjusted through control of point distribution distance and number, subdivision grid model files meeting design requirements are finally output, and rapid adjustment of a grid division mode is achieved on the premise that the space form of the original grid is maintained.
The technical scheme is as follows: in order to realize the purpose of the invention, the technical scheme adopted by the invention is as follows: a triangulation method of a space mesh model of a special-shaped curved surface structure comprises the following steps:
(1) Acquiring an original form design space grid model of the special-shaped curved surface structure; the special-shaped curved surface structure comprises a building facade and a landscape structure; the method comprises the steps that an original form design space grid model is processed, so that the specific requirements of actual construction and construction effects on the size and uniformity of grid units are met;
(2) Inputting an original space grid model to be subdivided into a computer, and establishing a Half-Edge data structure unit information retrieval system according to the original space grid model; the system is used for recording and calling the adjacent information of the cell surface of the original space grid model; determining a space grid model with adjacent surface information records as an initial grid model;
(3) Presetting the node number and unit size target value of the newly-built grid obtained after subdivision according to actual design requirements, and using the node number and unit size target value as a basis for further optimizing the number of intelligent agents and mutual exclusion radius between the intelligent agents; setting an initial value of the number of agents and an initial value of a repulsion radius; the intelligent agent is an individual unit capable of generating interactive influence with a group environment, and is a computing entity formed by abstracting points on a space grid surface;
(4) Randomly distributing intelligent agents in the initial grid model according to the preset grid node number and unit size target value in the step (3), wherein the intelligent agents and other intelligent agents within the exclusion radius of the intelligent agents are mutually exclusive and tend to be dispersed, after N iterations, the intelligent agents are uniformly distributed on the grid surface of the initial grid model, and all the intelligent agents are added into a newly-built space grid node list;
(5) According to the newly-built space grid node list, taking the uniformly-distributed intelligent agent space coordinates as reference nodes, and building a new triangulation space grid;
(6) And (4) when the generated subdivision grid in the step (5) cannot achieve the expected effect, adjusting the mutual exclusion radius between the intelligent agents and the quantity of the intelligent agents, repeating the steps (4) to (5) until the generated subdivision grid achieves the expected effect, namely the unit surface size and the grid uniformity of the grid meet the specific design requirements of the model and the process, and completing the triangulation of the space grid model.
Further, the Half-Edge data structure of the Half-Edge is established in the step (2), and the method comprises the following steps:
firstly, the vertex in the original mesh is shared by the edge and the face in the mesh in a list form, and the vertex list is marked as P; any edge a in the original grid is described by two grouped half edges, and the two half edges have opposite directions and belong to two adjacent grid surfaces connected by the edge a respectively;
secondly, storing the reference position of the starting point and the end point of each half edge in the vertex list P; each half is shared by the surfaces in the grid in a list form; recording the reference position of each half inside any surface in the original grid in a half list; for any half of any surface, searching for adjacent information of the grid surface by retrieving the other half grouped with the any half;
and finally, the mutual reference relation among the vertex, the Half Edge and the surface forms a Half-Edge data structure.
Further, the randomly distributed agents in the initial grid model in the step (4) are distributed through a Multi-Agent algorithm, the algorithm is a common algorithm in the field of computer building generation design, the space coordinates of each Agent and the information of the grid surface where the Agent is located are recorded, whether other agents exist in the set radius range of the Agent is judged, and if the other agents exist, repulsive force caused by interaction of all agents in the range is received.
Further, after the N iterations, the uniform dispersion of the agent on the initial grid model grid surface is realized; the method comprises the following steps: according to the mutual repulsion radius between the set intelligent agents, the intelligent agents generate mutual repulsion force to other intelligent agents in the radius and move along the respective repulsion direction of the original grid surface; the agent rejection motion is simultaneously limited by the edges of the initial mesh model; after N iterations, until no other agents exist in the repulsion radius range of all agents, or repulsion forces in all directions borne by any agent keep balance, mutual repulsion motion among agents tends to be stable, and even dispersion of agents on the initial grid model grid surface is realized.
Further, the step (4) adopts a loop iteration mode to carry out N times of iterations, so as to realize the uniform distribution of the intelligent agent on the initial grid model grid surface; the method comprises the following steps:
(4.1) the ith agent generates repulsion to other agents within the repulsion radius of the ith agent, and when the distance from the ith agent to the grid edge is less than the repulsion radius of the agent, the ith agent is subjected to the repulsion of the grid edge; judging whether the ith agent is stressed in balance; if the stress of the ith agent is balanced, entering the step (4.2); if the stress of the ith intelligent agent is unbalanced, entering the step (4.3);
(4.2) adding the ith agent into a newly-built space grid node list; entering the step (4.6);
(4.3) the ith agent moves along the projection direction of the resultant force applied to the ith agent on the network unit surface corresponding to the ith agent, and whether the ith agent exceeds the boundary of the unit surface is judged; if yes, entering the step (4.4); if not, entering the step (4.5);
(4.4) inquiring a unit surface which is about to enter by the ith intelligent agent, projecting the unit surface on the plane, updating the information of the grid surface where the intelligent agent is located, and returning to the step (4.3);
(4.5) updating stress information of the intelligent agent, and then returning to the step (4.1);
and (4.6) performing stress balance judgment on all the intelligent agents according to the steps (4.1) to (4.5) until all the intelligent agents are added into the new space grid node list.
Further, in the step (5), establishing a new triangulation space grid by taking the space coordinates of the intelligent agent as reference nodes; the method comprises the following steps:
(5.1) taking the space coordinates of the intelligent agent as reference nodes, projecting the reference nodes on corresponding grid surfaces, and determining the connection relation between the reference nodes through a Delaunay triangulation algorithm;
(5.2) establishing a primary triangulation space grid M according to the reference nodes and the connection relation thereof;
(5.3) for any triangular mesh surface ABC in the spatial mesh M and the adjacent triangular mesh surface CBD, the edge BC is a common edge for two surfaces, the points A and D are respectively opposite vertexes of the edge BC on the surface ABC and the surface CBD, and if the length of the edge BC is larger than the distance between the points A and D, the mesh surface ABC and the mesh surface CBD are respectively replaced by a mesh surface ABD and a mesh surface DCA which take the edge AD as a common edge;
and (5.4) repeating the step (5.3) until the length of the common edge of any two adjacent triangular mesh surfaces in the space mesh is not more than the distance between two opposite vertexes of the common edge, and obtaining the space mesh which is the new triangulation space mesh.
Has the advantages that: compared with the prior art, the technical scheme of the invention has the following beneficial technical effects: the invention provides a triangulation method of a space mesh model of a special-shaped curved surface structure. The invention can realize the accurate control of the size and the uniformity of the newly-built grid model unit, improves the efficiency of relevant computer modeling work, saves time, can adjust the newly-built grid in real time through the setting of various parameters, and has simple and intuitive operation.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a diagram of an initial mesh model of the present invention;
FIG. 3 is a diagram of an initial mesh model of uniformly dispersed agents of the present invention;
FIG. 4 is a schematic diagram of the adjustment of the preliminary triangulated spatial mesh M in step 5 of the present invention;
FIG. 5 is a mesh model diagram after the invention completes the triangulation of the spatial mesh model.
Detailed Description
The technical solution of the present invention is further described below with reference to the accompanying drawings and examples. It is to be understood that the described embodiments are merely exemplary of the invention, and not restrictive of the full scope of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The flow of the embodiment of the invention is shown in fig. 1, and the method for triangulating the space mesh model of the special-shaped curved surface structure comprises the following steps:
(1) Acquiring an original form design space grid model of the special-shaped curved surface structure; the special-shaped curved surface structure comprises a building facade and a landscape structure; the method comprises the steps of processing an original form design space grid model to meet specific requirements of actual construction and construction effects on the size and uniformity of grid units;
(2) Inputting an original space grid model to be subdivided into a computer, and establishing a Half-Edge data structure unit information retrieval system according to the original space grid model; the system is used for recording and calling the adjacent information of the cell surface of the original space grid model; determining a space grid model with adjacent surface information records as an initial grid model; the initial mesh model is shown in FIG. 2;
(3) Presetting the node number and unit size target value of the newly-built grid obtained after subdivision according to actual design requirements, and using the node number and unit size target value as a basis for further optimizing the number of intelligent agents and mutual exclusion radius between the intelligent agents; setting an initial value of the number of agents and an initial value of a repulsion radius; the intelligent agent is an individual unit capable of generating interactive influence with a group environment, and is a computing entity formed by abstracting points on a space grid surface;
(4) Randomly distributing the intelligent agents in the initial grid model according to the number of grid nodes and the unit size target value preset in the step (3), wherein the intelligent agents and other intelligent agents within the exclusion radius of the intelligent agents mutually repel and tend to disperse, and after N iterations, the intelligent agents are uniformly distributed on the grid surface of the initial grid model, and all the intelligent agents are added into a new space grid node list as shown in FIG. 3;
(5) According to the newly-built space grid node list, taking the uniformly-distributed intelligent agent space coordinates as reference nodes, and building a new triangulation space grid;
(6) And (5) when the generated mesh fails to achieve the expected effect, adjusting the mutual exclusion radius between the intelligent agents and the number of the intelligent agents, repeating the steps (4) to (5) until the generated mesh achieves the expected effect, namely the mesh unit surface size and the mesh uniformity meet the specific design requirements of modeling and process, and completing the triangulation of the space mesh model, as shown in fig. 5.
Step (2) of establishing a Half-an Edge Half-Edge data structure, the method comprises the following steps:
firstly, the vertex in the original mesh is shared by the edge and the face in the mesh in a list form, and the vertex list is marked as P; any edge a in the original grid is described by two grouped halves, and the two halves are opposite in direction and belong to two adjacent grid surfaces connected with a respectively;
secondly, storing the reference position of the starting point and the end point of each half edge in the vertex list P; each half is shared by the surfaces in the grid in a list form; recording the reference position of each half inside any surface in the original grid in a half list; for any half of any surface, searching for adjacent information of the grid surface by retrieving the other half grouped with the any half;
and finally, the vertex, the Half Edge and the surface are quoted mutually to form a Half Edge data structure.
And (4) randomly distributing the intelligent agents in the initial grid model by using a Multi-Agent algorithm, wherein the algorithm is a common algorithm in the field of computer building generation design, the space coordinate and the grid surface information of each intelligent Agent are recorded, whether other intelligent agents exist in the set radius range of the intelligent agents is judged, and if the intelligent agents exist, repulsive force generated by interaction of all the intelligent agents in the range is received.
After the N iterations, the uniform distribution of the intelligent agent on the initial grid model grid surface is realized; the method comprises the following steps: according to the mutual repulsion radius between the set intelligent agents, the intelligent agents generate mutual repulsion force to other intelligent agents in the radius and move along the respective repulsion direction of the original grid surface; the agent rejection motion is simultaneously limited by the edges of the initial mesh model; after N iterations, until no other agents exist in the repulsion radius range of all agents, or repulsion forces in all directions borne by any agent keep balance, mutual repulsion motion among agents tends to be stable, and even dispersion of agents on the initial grid model grid surface is realized.
The step (4) adopts a loop iteration mode to carry out N times of iterations, so as to realize the uniform distribution of the intelligent agent on the initial grid model grid surface; the method comprises the following steps:
(4.1) the ith agent generates repulsion to other agents within the repulsion radius of the ith agent, and when the distance from the ith agent to the grid edge is less than the repulsion radius of the agent, the ith agent is subjected to the repulsion of the grid edge; judging whether the ith intelligent agent is balanced in stress or not; if the stress of the ith agent is balanced, entering the step (4.2); if the stress of the ith intelligent agent is unbalanced, entering the step (4.3);
(4.2) adding the ith agent into a newly-built space grid node list; entering the step (4.6);
(4.3) the ith intelligent agent moves along the projection direction of the resultant force applied to the ith intelligent agent on the network unit surface corresponding to the intelligent agent, and whether the intelligent agent exceeds the boundary of the unit surface is judged; if yes, entering the step (4.4); if not, entering the step (4.5);
(4.4) inquiring a unit surface which is about to enter by the ith intelligent agent, projecting the unit surface on the plane, updating the information of the grid surface where the intelligent agent is positioned, and returning to the step (4.3);
(4.5) updating stress information of the intelligent agent, and then returning to the step (4.1);
and (4.6) performing stress balance judgment on all the agents according to the steps (4.1) to (4.5) until all the agents are added into the node list of the newly-built space grid.
In the step (5), the space coordinates of the intelligent agent are used as reference nodes, and a new triangulation space grid is established; the method comprises the following steps:
(5.1) taking the space coordinates of the intelligent agent as reference nodes, projecting the reference nodes on corresponding grid surfaces, and determining the connection relation between the reference nodes through a Delaunay triangulation algorithm;
(5.2) establishing a primary triangulation spatial mesh M according to the reference nodes and the connection relation thereof;
(5.3) for any triangular mesh surface ABC in the spatial mesh M and the adjacent triangular mesh surface CBD thereof, as shown in FIG. 4, the edge BC is a two-surface common edge, the points A and D are the opposite vertexes of the edge BC on the surface ABC and the surface CBD respectively, if the length of the edge BC is greater than the distance between the points A and D, the mesh surface ABC and the mesh surface CBD are replaced by a mesh surface ABD and a mesh surface DCA respectively, the edge AD is taken as a common edge;
(5.4) repeating the step (5.3) until the length of the common edge of any two adjacent triangular mesh surfaces in the space mesh is not more than the distance between two opposite vertexes of the common edge, and obtaining the space mesh which is the new triangulation space mesh.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned.
Furthermore, it should be understood that although the present description refers to embodiments, not every embodiment may contain only a single embodiment, and such description is for clarity only, and those skilled in the art should integrate the description, and the embodiments may be combined as appropriate to form other embodiments understood by those skilled in the art.
Claims (6)
1. A space mesh model triangulation method of a special-shaped curved surface structure is characterized by comprising the following steps: the method comprises the following steps:
(1) Acquiring an original form design space grid model of a special-shaped curved surface structure; the special-shaped curved surface structure comprises a building facade and a landscape structure; the method comprises the steps that an original form design space grid model is processed, so that the specific requirements of actual construction and construction effects on the size and uniformity of grid units are met;
(2) Inputting an original space grid model needing to be subdivided into a computer, and establishing a Half-Edge data structure unit information retrieval system according to the original space grid model; the system is used for recording and calling the adjacent information of the cell surface of the original space grid model; determining a space grid model with adjacent surface information records as an initial grid model;
(3) Presetting the node number and unit size target value of the newly-built grid obtained after subdivision according to actual design requirements, and using the node number and the unit size target value as a basis for further optimizing the number of the intelligent agents and mutual exclusion radius between the intelligent agents; setting an initial value of the number of agents and an initial value of a repulsion radius;
(4) Randomly distributing the intelligent agents in the initial grid model according to the preset grid node number and the unit size target value in the step (3), wherein the intelligent agents and other intelligent agents in the exclusion radius of the intelligent agents mutually exclude each other and tend to be dispersed,Nafter the iteration, the uniform distribution of the intelligent agents on the grid surface of the initial grid model is realized, and all the intelligent agents are added into a newly-built space grid node list;
(5) According to the newly-built space grid node list, taking the uniformly-distributed intelligent agent space coordinates as reference nodes, and building a new triangulation space grid;
(6) And (4) when the generated subdivision grid in the step (5) cannot achieve the expected effect, adjusting the number of the intelligent agents and the mutual exclusion radius between the intelligent agents, repeating the steps (4) to (5) until the generated subdivision grid achieves the expected effect, namely the surface size of a grid unit and the grid uniformity meet the specific design requirements of modeling and technology, and completing the triangulation of the space grid model.
2. The method of claim 1, wherein the method comprises the steps of: establishing a Half-Edge data structure of the Half-Edge in the step (2), the method comprises the following steps:
first, the vertices in the original mesh are shared as edges and faces in the mesh in the form of a list, which is denoted as the vertex listP(ii) a Arbitrary edge in original gridaDescribed by two grouped halves which are oppositely directed and respectively assignedaTwo adjacent connected mesh surfaces;
secondly, storing the start point and the end point of each half in a vertex listPThe reference location in (a); each half is shared by the surfaces in the grid in a list form; recording the reference positions of each half of the interior of any surface in the original grid in a half list; for any half of any surface, searching for adjacent information of the grid surface by retrieving the other half grouped with the any half;
and finally, the mutual reference relation among the vertex, the Half Edge and the surface forms a Half-Edge data structure.
3. The method of claim 1, wherein the method comprises the steps of: and (4) randomly distributing the intelligent agents in the initial grid model by using a Multi-Agent algorithm, recording the space coordinates and the grid surface information of each intelligent Agent by using the algorithm, judging whether other intelligent agents exist in the set radius range of the intelligent agents, and if so, receiving repulsive force of interaction of all the intelligent agents in the range.
4. The method of claim 3, wherein the method comprises the steps of: step (4) ofNAfter the secondary iteration, the uniform distribution of the intelligent agent on the initial grid model grid surface is realized; the method comprises the following steps: according to the mutual repulsion radius between the set intelligent agents, the intelligent agents generate mutual repulsion force to other intelligent agents in the radius and move along the respective repulsion direction of the original grid surface; the repellent movement of the agent is simultaneously subjected to the initial netLimitation of lattice model edges; throughNAnd (4) performing iteration for the second time until no other agents exist in the exclusion radius range of all the agents or the exclusion force of any agent in each direction is kept balanced, and mutual exclusion motion among the agents tends to be stable, namely, the agents are uniformly dispersed on the mesh surface of the initial mesh model.
5. The method of claim 4, wherein the method comprises the steps of: the step (4) is carried out in a loop iteration modeNPerforming secondary iteration to realize uniform distribution of the intelligent agent on the grid surface of the initial grid model; the method comprises the following steps:
(4.1) the firstiThe individual agent generates a repulsive force to other agents within its repulsive radius, and when it is the firstiWhen the distance from the intelligent agent to the edge of the grid is smaller than the repulsion radius of the intelligent agent, the repulsion force of the edge of the grid to the intelligent agent is applied; judgment of the firstiWhether the individual agent is force balanced; if it is firstiThe stress of the intelligent agent is balanced, and the step (4.2) is carried out; if it is firstiThe stress of the intelligent agent is unbalanced, and the step (4.3) is carried out;
(4.2) subjectingiAdding an agent into a newly-built space grid node list; entering the step (4.6);
(4.3) the firstiThe intelligent agent moves along the projection direction of the resultant force applied to the intelligent agent on the network unit surface corresponding to the intelligent agent, and whether the intelligent agent exceeds the boundary of the unit surface is judged; if yes, entering the step (4.4); if not, entering the step (4.5);
(4.4) query ofiThe unit surface which the intelligent agent is about to enter is projected on the unit surface, the information of the grid surface where the intelligent agent is located is updated, and the step (4.3) is returned;
(4.5) updating stress information of the intelligent agent, and then returning to the step (4.1);
and (4.6) judging stress balance of all the intelligent agents according to the steps (4.1) - (4.5) until all the intelligent agents are added into a newly-built space grid node list.
6. The method for triangulating the spatial mesh model of a structure with a profiled curved surface according to any one of claims 1 to 4, wherein: in the step (5), the space coordinates of the intelligent agent are used as reference nodes, and a new triangulation space grid is established; the method comprises the following steps:
(5.1) taking the space coordinates of the intelligent agent as reference nodes, projecting the reference nodes on a corresponding grid surface, and determining the connection relation between the reference nodes through a Delaunay triangulation algorithm;
(5.2) establishing a primary triangulation space grid M according to the reference nodes and the connection relation thereof;
(5.3) for any triangular mesh surface ABC in the spatial mesh M and an adjacent triangular mesh surface CBD, the edge BC is a common edge for two surfaces, the points A and D are respectively opposite vertexes of the edge BC on the surface ABC and the surface CBD, and if the length of the edge BC is greater than the distance between the two points A and D, the mesh surface ABC and the mesh surface CBD are respectively replaced by a mesh surface ABD and a mesh surface DCA which take the edge AD as a common edge;
(5.4) repeating the step (5.3) until the length of the common edge of any two adjacent triangular mesh surfaces in the space mesh is not more than the distance between two opposite vertexes of the common edge, and obtaining the space mesh which is the new triangulation space mesh.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910535203.3A CN110363859B (en) | 2019-06-20 | 2019-06-20 | Spatial mesh model triangulation method for special-shaped curved surface structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910535203.3A CN110363859B (en) | 2019-06-20 | 2019-06-20 | Spatial mesh model triangulation method for special-shaped curved surface structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110363859A CN110363859A (en) | 2019-10-22 |
| CN110363859B true CN110363859B (en) | 2023-01-17 |
Family
ID=68217396
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910535203.3A Active CN110363859B (en) | 2019-06-20 | 2019-06-20 | Spatial mesh model triangulation method for special-shaped curved surface structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110363859B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111027250B (en) * | 2019-12-11 | 2023-06-16 | 大连理工大学 | Modeling method for special-shaped curved surface reinforcement shell based on grid deformation technology |
| US11361494B2 (en) | 2020-10-23 | 2022-06-14 | Unity Technologies Sf | Method for scattering points in a uniform arbitrary distribution across a target mesh for a computer animated creature |
| CN113591260B (en) * | 2021-08-19 | 2023-09-05 | 上海电机系统节能工程技术研究中心有限公司 | Method and device for generating electromagnetic field grid model of motor and electronic equipment |
| CN117315196A (en) * | 2023-10-08 | 2023-12-29 | 广州中望龙腾软件股份有限公司 | Model construction method, device, equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102306396A (en) * | 2011-09-15 | 2012-01-04 | 山东大学 | Three-dimensional entity model surface finite element mesh automatic generation method |
| CN106599463A (en) * | 2016-12-14 | 2017-04-26 | 浙江精工钢结构集团有限公司 | Free-form surface-based parametric modeling method of space grid structure |
-
2019
- 2019-06-20 CN CN201910535203.3A patent/CN110363859B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102306396A (en) * | 2011-09-15 | 2012-01-04 | 山东大学 | Three-dimensional entity model surface finite element mesh automatic generation method |
| CN106599463A (en) * | 2016-12-14 | 2017-04-26 | 浙江精工钢结构集团有限公司 | Free-form surface-based parametric modeling method of space grid structure |
Non-Patent Citations (1)
| Title |
|---|
| 建筑生成设计的随机与约束——以多智能体地块优化为例;郭梓峰 等;《西部人居环境学刊》;20141230;第29卷(第6期);第13-16页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110363859A (en) | 2019-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110363859B (en) | Spatial mesh model triangulation method for special-shaped curved surface structure | |
| CN105844691A (en) | Three-dimensional reconstruction method for disordered points | |
| WO2022121525A1 (en) | Method and device for rendering three-dimensional scene data, storage medium, and electronic device | |
| CN105718643A (en) | Optimization view angle based ship production design drawing-inspection device implementation method | |
| CN112819962B (en) | Non-uniform grid division and local grid density method in digital image correlation | |
| CN114494648B (en) | Grid adjusting method, equipment and storage medium based on finite element meshing | |
| Wang et al. | Fast mesh simplification method for three-dimensional geometric models with feature-preserving efficiency | |
| Zou et al. | Collision detection for virtual environment using particle swarm optimization with adaptive cauchy mutation | |
| CN111310344B (en) | Method for considering coupling effect of wind field and fire field in forest fire spreading simulation | |
| CN106960470A (en) | Three-dimensional point cloud curve reestablishing method and device | |
| CN108986218A (en) | A kind of building point off density cloud fast reconstructing method based on PMVS | |
| CN114996658B (en) | Projection-based hypersonic aircraft aerodynamic heat prediction method | |
| Zhang et al. | A new kmeans clustering algorithm for point cloud | |
| CN104899929A (en) | Mesh subdivision method based on laplacian coordinates | |
| Guclu et al. | Synchronization landscapes in small-world-connected computer networks | |
| Leal et al. | Simple method for constructing nurbs surfaces from unorganized points | |
| Velho | Mesh simplification using four-face clusters | |
| CN105426626B (en) | Multiple-Point Geostatistics modeling method based on set of metadata of similar data pattern cluster | |
| Liu et al. | A novel terrain rendering algorithm based on quasi Delaunay triangulation | |
| CN104036552A (en) | Method for generating blue noise meshes on basis of farthest point optimization | |
| Franceschini et al. | Decentralized approach for efficient simulation of DEVS models | |
| CN109684424B (en) | Landform data rapid generation and optimization method based on discrete characteristic line | |
| Hao et al. | Surface reconstruction based on CAD model driven priori templates | |
| Nguyen | Building TIN (triangular irregular network) problem in topology model | |
| Nie et al. | A node placement method with high quality for mesh generation |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |