CN117094197A - CDT parameterized grid and global isotropy re-gridding method - Google Patents
CDT parameterized grid and global isotropy re-gridding method Download PDFInfo
- Publication number
- CN117094197A CN117094197A CN202311077893.5A CN202311077893A CN117094197A CN 117094197 A CN117094197 A CN 117094197A CN 202311077893 A CN202311077893 A CN 202311077893A CN 117094197 A CN117094197 A CN 117094197A
- Authority
- CN
- China
- Prior art keywords
- grid
- cdt
- parameterized
- vertex
- optimization
- 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 33
- 238000005457 optimization Methods 0.000 claims abstract description 32
- 238000005070 sampling Methods 0.000 claims abstract description 9
- 238000004458 analytical method Methods 0.000 claims abstract description 7
- 230000000007 visual effect Effects 0.000 claims abstract description 5
- 238000011084 recovery Methods 0.000 claims abstract description 4
- 238000009499 grossing Methods 0.000 claims description 7
- 238000013507 mapping Methods 0.000 claims description 7
- 230000005484 gravity Effects 0.000 claims description 4
- 238000005192 partition Methods 0.000 claims description 3
- 238000007670 refining Methods 0.000 claims description 3
- 230000007547 defect Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000012937 correction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012805 post-processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 238000006467 substitution reaction 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]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/04—Constraint-based CAD
Abstract
The application discloses a CDT parameterized grid and global isotropy re-gridding method, which comprises the following steps: step 1: generating a visual triangle by using the OCCT model; step 2: grid parameterization: based on the initial triangulation, the parameterized domain for each patch is reconstructed and CDT is reapplied to preserve the boundaries of each parameterized domain, and then the 2D triangulation is projected back into 3D space. Reconstructing the parameter domain of each curved surface piece through initial triangulation, generating a triangle with a better shape through the recovery and sampling of a boundary curve and angle optimization, and further accelerating the re-meshing process; through the price optimization of the inner vertex, the price regularization is improved, and the approximation error is kept, so that the accuracy of the model on a three-dimensional model display system and the success rate of various numerical analyses are increased.
Description
Technical Field
The application relates to the technical field of geometric surface modeling, in particular to a method for reconstructing another high-quality triangular grid based on improved global isotropy re-gridding.
Background
Grid parameterization can convert complex grid model processing into relatively simple parameterized grid processing, and is widely applied in many fields, and meanwhile, the re-meshing of a three-dimensional grid model is an important content of computer graphics and is an important component of many geometric applications.
The mesh generation problem is a fundamental and important issue in computer graphics research, good meshes can often achieve a balance between quality and computation, while low quality meshes often prevent convergence of solutions and increase analysis errors. With the increase of computer processing power and the development of three-dimensional scanning techniques and visual reconstruction techniques, the generation of high quality grids has become a key to the success of numerical analysis. The grid parameterization method is one of the most important algorithms for repairing the grid quality, can be used for processing low-quality grids and improving the grid quality, and can further improve the grid quality if the grid parameterization method can be used for grid refinement at first and then the improved global isotropy re-gridding method is used for reconstructing the high-quality triangular grid.
Through retrieval, the Chinese patent with the application number of CN109671154A discloses a curved surface non-iterative re-meshing method represented by triangular grids, which refers to the problem that the curved surface represented by the triangular grids is deformed as a result after reconstruction, and refers to the technical means of inputting a grid model to restore the missing part when grid re-dividing is adopted;
the Chinese patent of application number CN105243688B discloses a non-obtuse angle re-gridding method based on a gravity center Voronoi diagram, and aims to solve the technical problem of how to enable a re-gridding result of a curved surface to not contain obtuse triangles and small-angle triangles.
The conventional repair grid quality algorithm can be mainly divided into local correction and global re-gridding. Local correction can only modify a single defect and the grid in the cell surrounding the defect; global re-meshing is typically based on repartitioning the input using some intermediate data structure. However, most schemes focus only on certain defect types, neglecting and even introducing other defects, and most algorithms currently do not consider improving the triangle quality of the output grid, generally cannot process grids with sharp features, and in practical applications, post-processing is generally required.
Disclosure of Invention
The application aims to solve the defects in the prior art and provides a CDT parameterized grid and global isotropy re-gridding method.
In order to achieve the above purpose, the present application adopts the following technical scheme:
a method of parameterizing a grid based on CDT and globally isotropic re-gridding, comprising the steps of:
step 1: generating a visual triangle by using the OCCT to control the distance between the initial subdivision and the original analysis surface, and keeping geometric fidelity, namely small approximation error, in addition, collecting original vertexes of the input geometric body from the B-rep model, and then identifying the vertexes in the initial triangulation, wherein the vertexes are marked with a locking mark;
step 2: grid parameterization: reconstructing the parameterized domain of each patch based on the initial triangulation and reapplying CDT to preserve boundaries of each parameterized domain, then projecting the 2D triangulation back into 3D space;
step 3: global re-gridding: the grid optimization is performed by a series of algorithms of dividing edges, angle optimization, folding edges, price optimization of vertices, tangential laplace smoothing, applying a global isotropic re-gridding technique.
Further, the step S2 specifically further includes the following steps:
s201: dough sheet re-parameterization: first reconstructing a one-to-one mapping from each mesh patch to a simple 2D domain using SLIM (Scalable Locally Injective Mappings) parameterization, resulting in an initial triangulation of a pair of parametric coordinates (u, v) for each vertex;
s202: boundary curve recovery and sampling: assuming the mesh is represented by a half data structure, one half h labeled "locked" from the vertex 1 Initially, the previous boundary half is recursively accessed until another vertex labeled "locked" half is encountered. These linear segments then form a boundary curve c i ＝{h 1 ,…,h k After all the half edges are processed, a group of boundary curves are collected
S203: triangulation: based on the reconstructed parameter space and the restored boundary curve, refining each grid patch, performing coarse triangulation by a parameterized grid method, and organizing sampling points on the boundary curve into a bounded region in a two-dimensional space, wherein the region is defined by PSLGs, and each part of the PSLGs is regarded as a constraint condition and is input into our algorithm to construct CDT; then, an improved grid is obtained by invoking the Delaunay refinement method with default shape and size criteria; finally, each patch of the 2D mesh is mapped back into 3D space.
Further, the step 2 specifically further includes the following steps:
s301: dividing edges: given a target length l target Splitting all longer thanIs a side of (2);
s302: and (3) angle optimization: if the sum of the two opposite angles of a side is greater than 180 degrees, the side is flipped, wherein this operation is performed only in the first iteration; s303: folding: folding all shorter thanIs a side of (2);
s304: valence optimization of the inner vertex: when the condition is met, the non-characteristic edge is turned over;
s305: performing price optimization of the characteristic vertexes;
s306: tangential laplace smoothing: to optimize the vertex distribution, the locations are repositioned by calculating the optimal ODT.
Further, in step S304, the price of the inner vertex is optimized, and the non-feature edge is flipped when the following two conditions are satisfied:
1: reducing the square difference of the prices of the four vertices of the two associated triangles to an optimal value of 6;
2: the projected distance of the midpoint of the edge to the input CAD model is not increased.
Further, the specific step flow of the price optimization of the feature vertex in step S305 is as follows:
the vertex A is taken as a non-6-valent characteristic vertex, and two incidence half sides h thereof 1 And h 2 On the same side of A;
let θ be h 1 And h 2 Angle between n t Denoted as h 1 And h 2 The number of triangles between, the required number of triangles is calculated as
Optimizing according to the situation, wherein the different situations specifically comprise:
1: if n t <n' t Where θ=180°, n t ＝2，n' t =3: opposite sides BD of partition A;
2: if n t >n' t Wherein n is t ＝4，n' t Iteratively folding the opposite side CD of the minimum angle, until n =3 t ＝n' t ：
Further, in step S306, each vertex is moved to its incident triangleCenter of gravity b of (2) tj Mean p of (2) i Weighted by triangle area:
select the new position p i Projected back onto the original surface sheet to reduce approximation errors.
Compared with the prior art, the application has the beneficial effects that:
the application reconstructs the parameter domain of each curved surface piece through initial triangulation, and obtains improved grids by recovering and sampling boundary curves and re-triangulating the boundary of the parameter domain by CDT, and then obtains improved curved surface subdivision with consistency by mapping each surface piece of the 2D grid back to 3D space. Through angle optimization, a triangle with a better shape is generated, and the re-meshing process is further accelerated. The price regularization is improved through the price optimization of the inner vertexes, the approximation error is kept, and the quality near the grid characteristic edges can be remarkably improved through the price optimization of the characteristic vertexes. And finally, using tangential Laplace smoothing to optimize vertex distribution and improve the angle quality of the grid.
The method greatly improves the regularity and the angle quality of the subdivision grid, thereby increasing the accuracy of the subdivision grid on a three-dimensional model display system and the success rate of various numerical analyses.
Drawings
The accompanying drawings are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate the application and together with the embodiments of the application, serve to explain the application.
FIG. 1 is a basic flow diagram of grid parameterization and global re-meshing in an embodiment of the present application;
FIG. 2 is a schematic diagram of the price optimization of feature vertices in an embodiment of the application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments.
Referring to fig. 1-2, a method for parameterizing a grid based on CDT and globally isotropic regnet, comprising the steps of:
step 1: generating a visual triangle by using the OCCT to control the distance between the initial subdivision and the original analysis surface, and keeping geometric fidelity, namely small approximation error, in addition, collecting original vertexes of the input geometric body from the B-rep model, and then identifying the vertexes in the initial triangulation, wherein the vertexes are marked with a locking mark;
step 2: grid parameterization: reconstructing the parameterized domain of each patch based on the initial triangulation and reapplying CDT to preserve boundaries of each parameterized domain, then projecting the 2D triangulation back into 3D space;
step 3: global re-gridding: the grid optimization is performed by a series of algorithms of dividing edges, angle optimization, folding edges, price optimization of vertices, tangential laplace smoothing, applying a global isotropic re-gridding technique.
In a specific embodiment of the present application, step S2 specifically further includes the following steps:
s201: dough sheet re-parameterization: first reconstructing a one-to-one mapping from each mesh patch to a simple 2D domain using SLIM (Scalable Locally Injective Mappings) parameterization, resulting in an initial triangulation of a pair of parametric coordinates (u, v) for each vertex;
s202: boundary curve recovery and sampling: assuming the mesh is represented by a half data structure, one half h labeled "locked" from the vertex 1 Initially, the previous boundary half is recursively accessed until another vertex labeled "locked" half is encountered. These linear segments then form a boundary curve c i ＝{h 1 ,…,h k After all the half edges are processed, a group of boundary curves are collected
Currently, each curve c of the input geometry has been identified in its two input mesh patches (the adjacency relationship between the different patches has been pre-stored in the initial triangulation), corresponding to c respectively i And c' i 。
To achieve consistent discretization of each common curve c, we are at c i And c' i Respectively, to generate the same number of uniform samples. The length of curve c is denoted as l c The sampling interval of the curve is denoted as δ=αl target (alpha is set to 0.6-0.8). Therefore, the number of points to be sampled isWherein max (a, b) function returns the larger of a and b. Finally, at c i And c' i N samples are uniformly generated over the sheet-like linear segment of (c). Use c i And c' i Definition on verticesThe parameter coordinates (u, v) of each sample are interpolated.
S203: triangulation: based on the reconstructed parameter space and the restored boundary curve, refining each grid patch, performing coarse triangulation by a parameterized grid method, and organizing sampling points on the boundary curve into a bounded region in a two-dimensional space, wherein the region is defined by PSLGs, and each part of the PSLGs is regarded as a constraint condition and is input into our algorithm to construct CDT; then, an improved mesh is obtained by calling the Delaunay refinement method with default shape and size criteria (default shape criteria b=0.125, size criteria s=0.5); finally, each patch of the 2D mesh is mapped back into 3D space.
In a specific embodiment of the present application, step 2 specifically further includes the following steps:
s301: dividing edges: given a target length l target Splitting all longer thanIs a side of (2);
s302: and (3) angle optimization: if the sum of the two opposite angles of a side is greater than 180 degrees, the side is flipped, wherein this operation is performed only in the first iteration; as the inputs for subsequent iterations have been shaped. Thus, this operation does not conflict with the price optimization in subsequent iterations;
s303: folding: folding all shorter thanIs a side of (2);
s304: valence optimization of the inner vertex: when the condition is met, the non-characteristic edge is turned over;
s305: performing price optimization of the characteristic vertexes;
s306: tangential laplace smoothing: to optimize the vertex distribution, the locations are repositioned by calculating the optimal ODT.
As a preferred embodiment of the present application, in step S304, the price optimization of the inner vertex is performed, and the non-feature edges are flipped when the following two conditions are satisfied:
reducing the square difference of the prices of the four vertices of the two associated triangles to an optimal value of 6 (assuming that no boundary edge exists for the closed model CAD model);
the projected distance of the midpoint of the edge to the input CAD model is not increased.
As another preferred embodiment of the present application, the specific step flow of the price optimization of the feature vertex in step S305 is as follows:
the price optimization scheme of the feature vertices is shown in fig. 2. The vertex A is taken as a non-6-valent characteristic vertex, and two incidence half sides h thereof 1 And h 2 On the same side of A;
let θ be h 1 And h 2 Angle between n t Denoted as h 1 And h 2 The number of triangles between, the required number of triangles is calculated as
Optimizing according to the situation, wherein the different situations specifically comprise:
as shown in FIG. 2 (a), if n t <n' t Where θ=180°, n t ＝2，n' t =3: opposite sides BD of partition A;
BD is selected because the valence optimum of vertex C is smaller than the valence of E. However, the segmentation introduces another vertex G with a valence of 4, so a local edge flip is performed to increase the valence of G (as shown in fig. 2 (b)).
As shown in FIG. 2 (c), if n t >n' t Wherein n is t ＝4，n' t Iteratively folding the opposite side CD of the minimum angle, until n =3 t ＝n' t 。
But care is taken to note n t >n' t Is rare because the above-described optimization of the price of the folded edge and the inner vertex can largely prevent this from happening.
As another preferred embodiment of the present application, in step S306, each vertex is moved to its incident triangleCenter of gravity b of (2) tj Mean p of (2) i Weighted by triangle area:
then, select the new position p i Projected back onto the original surface sheet to reduce approximation errors. Since a good balance between meshing speed and approximation error is to be achieved, projection is applied only in the first iteration. After all iterations, the edges are flipped again by angle. This operation improves angle quality and does not interfere with price regularization.
The foregoing is only a preferred embodiment of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art, who is within the scope of the present application, should make equivalent substitutions or modifications according to the technical scheme of the present application and the inventive concept thereof, and should be covered by the scope of the present application.
Claims (6)
1. A method for parameterizing a grid based on CDT and globally isotropic re-gridding, comprising the steps of:
step 1: generating a visual triangle by using the OCCT to control the distance between the initial subdivision and the original analysis surface, and keeping geometric fidelity, namely small approximation error, in addition, collecting original vertexes of the input geometric body from the B-rep model, and then identifying the vertexes in the initial triangulation, wherein the vertexes are marked with a locking mark;
step 2: grid parameterization: reconstructing the parameterized domain of each patch based on the initial triangulation and reapplying CDT to preserve boundaries of each parameterized domain, then projecting the 2D triangulation back into 3D space;
step 3: global re-gridding: the grid optimization is performed by a series of algorithms of dividing edges, angle optimization, folding edges, price optimization of vertices, tangential laplace smoothing, applying a global isotropic re-gridding technique.
2. The method of CDT-based parameterized meshing and globally isotropic regorarization of claim 1, wherein step S2 specifically further comprises the steps of:
s201: dough sheet re-parameterization: first reconstructing a one-to-one mapping from each mesh patch to a simple 2D domain using SLIM (Scalable Locally Injective Mappings) parameterization, resulting in an initial triangulation of a pair of parametric coordinates (u, v) for each vertex;
s202: boundary curve recovery and sampling: assuming the mesh is represented by a half data structure, one half h labeled "locked" from the vertex 1 Initially, recursively accessing its previous boundary half until another vertex labeled "locked" half is encountered; these linear segments then form a boundary curve c i ＝{h 1 ,…,h k After all the half edges are processed, a group of boundary curves are collected
S203: triangulation: based on the reconstructed parameter space and the restored boundary curve, refining each grid patch, performing coarse triangulation by a parameterized grid method, and organizing sampling points on the boundary curve into a bounded region in a two-dimensional space, wherein the region is defined by PSLGs, and each part of the PSLGs is regarded as a constraint condition and is input into our algorithm to construct CDT; then, an improved grid is obtained by invoking the Delaunay refinement method with default shape and size criteria; finally, each patch of the 2D mesh is mapped back into 3D space.
3. The method of CDT-based parameterized meshing and globally isotropic regorarization of claim 2, wherein step 2 specifically further comprises the steps of:
s301: dividing edges: given a target length l target Splitting all longer thanIs a side of (2);
s302: and (3) angle optimization: if the sum of the two opposite angles of a side is greater than 180 degrees, the side is flipped, wherein this operation is performed only in the first iteration; s303: folding: folding all shorter thanIs a side of (2);
s304: valence optimization of the inner vertex: when the condition is met, the non-characteristic edge is turned over;
s305: performing price optimization of the characteristic vertexes;
s306: tangential laplace smoothing: to optimize the vertex distribution, the locations are repositioned by calculating the optimal ODT.
4. A method of CDT-based parameterized meshing with globally isotropic regimenting according to claim 3, wherein in step S304, the cost optimization of the inner vertices is reversed when two conditions are met:
1: reducing the square difference of the prices of the four vertices of the two associated triangles to an optimal value of 6;
2: the projected distance of the midpoint of the edge to the input CAD model is not increased.
5. The method of CDT-based parameterized meshing and globally isotropic regimenting according to claim 4, wherein the specific step flow of the price optimization of feature vertices in step S305 is:
the vertex A is taken as a non-6-valent characteristic vertex, and two incidence half sides h thereof 1 And h 2 On the same side of A;
let θ be h 1 And h 2 Angle between n t Denoted as h 1 And h 2 The number of triangles between, the required number of triangles is calculated as
Optimizing according to the situation, wherein the different situations specifically comprise:
1: if n t <n' t Where θ=180°, n t ＝2，n' t =3: opposite sides BD of partition A;
2: if n t >n' t Wherein n is t ＝4，n' t Iteratively folding the opposite side CD of the minimum angle, until n =3 t ＝n' t 。
6. The method of CDT-based parameterized meshing with globally isotropic regimenting according to claim 5, wherein in step S306 each vertex is moved to its incident triangleCenter of gravity b of (2) tj Mean p of (2) i Weighted by triangle area:
select the new position p i Projected back onto the original surface sheet to reduce approximation errors.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311077893.5A CN117094197A (en) | 2023-08-24 | 2023-08-24 | CDT parameterized grid and global isotropy re-gridding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311077893.5A CN117094197A (en) | 2023-08-24 | 2023-08-24 | CDT parameterized grid and global isotropy re-gridding method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117094197A true CN117094197A (en) | 2023-11-21 |
Family
ID=88782547
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311077893.5A Pending CN117094197A (en) | 2023-08-24 | 2023-08-24 | CDT parameterized grid and global isotropy re-gridding method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117094197A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030206178A1 (en) * | 2002-05-01 | 2003-11-06 | Microsoft Corporation | Systems and methods for providing signal-specialized parametrization |
| CN101110126A (en) * | 2007-06-19 | 2008-01-23 | 北京大学 | Method for re-establishing three-dimensional model gridding |
| CN102930091A (en) * | 2012-10-24 | 2013-02-13 | 浙江大学 | Tooth-and-gum-oriented high-efficiency mesh repairing method |
| CN112862972A (en) * | 2021-02-22 | 2021-05-28 | 北京工商大学 | Surface structure grid generation method |
| CN116522496A (en) * | 2023-04-28 | 2023-08-01 | 北京航空航天大学 | Automatic three-dimensional airfoil quadrilateral mesh generation method based on symmetric direction field |
-
2023
- 2023-08-24 CN CN202311077893.5A patent/CN117094197A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030206178A1 (en) * | 2002-05-01 | 2003-11-06 | Microsoft Corporation | Systems and methods for providing signal-specialized parametrization |
| CN101110126A (en) * | 2007-06-19 | 2008-01-23 | 北京大学 | Method for re-establishing three-dimensional model gridding |
| CN102930091A (en) * | 2012-10-24 | 2013-02-13 | 浙江大学 | Tooth-and-gum-oriented high-efficiency mesh repairing method |
| CN112862972A (en) * | 2021-02-22 | 2021-05-28 | 北京工商大学 | Surface structure grid generation method |
| CN116522496A (en) * | 2023-04-28 | 2023-08-01 | 北京航空航天大学 | Automatic three-dimensional airfoil quadrilateral mesh generation method based on symmetric direction field |
Non-Patent Citations (4)
| Title |
|---|
| WANG, YQ ET AL.: "Isotropic Surface Remeshing without Large and Small Angles", IEEE, 14 June 2019 (2019-06-14) * |
| 严冬明等: "各向同性三角形重新网格化方法综述", 计算机科学, 15 August 2017 (2017-08-15) * |
| 杜兴逸: "方向场对齐的各向同性重网格化算法研究", 中国优秀硕士学位论文库信息科技辑, 15 April 2020 (2020-04-15) * |
| 韩英华;李桂清;彭莉;任灿江;: "对偶Voronoi聚类与重网格化", 计算机辅助设计与图形学学报, no. 11, 15 November 2009 (2009-11-15) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Qian et al. | PUGeo-Net: A geometry-centric network for 3D point cloud upsampling | |
| CN100561523C (en) | A kind of method for re-establishing three-dimensional model gridding | |
| US7948488B2 (en) | Shape preserving mappings to a surface | |
| CN107886569B (en) | Measurement-controllable surface parameterization method and system based on discrete lie derivative | |
| Yang et al. | Adaptive slicing of moving least squares surfaces: toward direct manufacturing of point set surfaces | |
| Marinov et al. | A robust two‐step procedure for quad‐dominant remeshing | |
| Wang et al. | EQSM: An efficient high quality surface grid generation method based on remeshing | |
| CN108876922B (en) | Grid repairing method based on internal dihedral angle compensation regularization | |
| Santos et al. | Integration of CAD Models into Game Engines. | |
| CN117094197A (en) | CDT parameterized grid and global isotropy re-gridding method | |
| CN115937460A (en) | Optimal transmission-based feature-preserving surface reconstruction method | |
| Bock et al. | Generation of high-order polynomial patches from scattered data | |
| CN111274732A (en) | Grid repairing method based on 'connection relation-position' iterative optimization | |
| CN104123696A (en) | Focus and context visualization method based on multiresolution | |
| Shi et al. | Mesh Simplification Method Based on Reverse Interpolation Loop Subdivision | |
| Wang et al. | Content-aware model resizing based on surface deformation | |
| Wang et al. | Gauss-Seidel Progressive Iterative Approximation (GS-PIA) for Loop Surface Interpolation. | |
| Liao et al. | Subdivision Surface Modeling Technology | |
| Urick et al. | Reconstruction of Trimmed NURBS Surfaces for Gap-Free Intersections | |
| Hube et al. | Seamless integration of analysis and design: Automatic CAD reconstruction of post-analysis geometries | |
| CN112116710B (en) | Curved surface reconstruction method based on trend constraint | |
| Lai et al. | Vertex location optimisation for improved remeshing | |
| Hui et al. | Generating subdivision surfaces from profile curves | |
| CN114549790A (en) | Quadrilateral mesh generation method based on normal filtering | |
| Miropolsky et al. | Utilizing diverse feature data for reconstruction of scanned object as a basis for inspection |
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 |