CN108564635A - A kind of section grid generation method based on surface model - Google Patents
A kind of section grid generation method based on surface model Download PDFInfo
- Publication number
- CN108564635A CN108564635A CN201810334622.6A CN201810334622A CN108564635A CN 108564635 A CN108564635 A CN 108564635A CN 201810334622 A CN201810334622 A CN 201810334622A CN 108564635 A CN108564635 A CN 108564635A
- Authority
- CN
- China
- Prior art keywords
- vertex
- triangle
- face
- grid
- generation method
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/003—Reconstruction from projections, e.g. tomography
- G06T11/005—Specific pre-processing for tomographic reconstruction, e.g. calibration, source positioning, rebinning, scatter correction, retrospective gating
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H30/00—ICT specially adapted for the handling or processing of medical images
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/30—Subject of image; Context of image processing
- G06T2207/30004—Biomedical image processing
Landscapes
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Radiology & Medical Imaging (AREA)
- Epidemiology (AREA)
- General Health & Medical Sciences (AREA)
- Nuclear Medicine, Radiotherapy & Molecular Imaging (AREA)
- Primary Health Care (AREA)
- Public Health (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Apparatus For Radiation Diagnosis (AREA)
- Image Generation (AREA)
Abstract
The section grid generation method based on surface model that the invention discloses a kind of, including：For each triangle, by each edge and cuts face counterclockwise and carry out asking friendship；According to the syntople between vertex and vertex, vertex is divided into one or more end to end closed polygon point sets；The new summit q that p is obtained along closed polygon internal blas is directed toward is calculated, the new summit set being made of q is denoted as Q；To set Q, the vertex q of wherein interior angle minimum is taken every time, its front and back adjacent two vertex X and Y are formed into triangles, and decides whether according to bundle factor μ to take the midpoint W of q opposite side, and the triangle is split into two triangles of XqW and qYW；All triangular apex in internal layer grid are obtained, and using the vertex in original collection Q as constraint, adjustment cuts the Triangle-Profile and size in face；Obtain the section grid of organ model.The present invention has the characteristics that processing speed is fast, accuracy is good, treatment effeciency is high.
Description
Technical field
The present invention relates to the medical image visible processing methods more particularly to one in computer medicine assisting in diagnosis and treatment system
Section grid generation method of the kind based on surface model.
Background technology
With the continuous development of computer technology, computer-aided diagnosis (CAD) plays more and more important in clinic
Role.Doctor acquires CT picture of patient, by computer image processing technology by interested organ and tissue with binary map
The form of picture is split, and then graph technology is used to carry out three-dimensional reconstruction, to obtain the three-dimensional grid mould of organ and tissue
Type.It is diagnosed relative to traditional two dimensional image, by the threedimensional model of diseased organ and tissue, doctor can be with multi-angle, Quan Fang
The observation of position ground and the lesion situation for understanding patient, to which more accurately the illness of patient and the state of an illness are diagnosed and be assessed,
And then propose more targeted and effective therapeutic scheme.
During the entire process of computer-aided diagnosis, since certain histoorgans react the spy on CT and MRI image
Property is similar, the phenomenon that different histoorgan adhesions and certain organs improper " hyperplasia " are often will appear in three-dimensional reconstruction.
Therefore, it after three-dimensional reconstruction, needs to carry out subsequent processing to model, wherein cut adhesion organ, to abnormal " increase
It is raw " grid carries out cutting excision and is very important post-processing means.Grid model after cutting can occur cutting position
" hole " needs to replenish " hole " progress trigonometric ratio generation grid.The grid currently existed cuts face generation side
Method is mainly the following：
The first, the grids handling implement such as 3DMax, Maya.Such tool software provides hole and replenishes tool, can be automatic
Hole existing for identification grid is simultaneously replenished automatically.Since the three-dimensional grid model after three-dimensional reconstruction is more complicated, cut
There may be redundancies and mistake for the hole edge information generated later, are directly handled using such tool it is possible that wrong
Accidentally result even results in program crashing, causes this method that can not use.
Second, the face that cuts that algorithm is cut based on ear is generated.Due to this method can not again cutting part (hole) it is internal
Generate new vertex, therefore the triangle for cutting surface grids and being mostly longer and narrower generated using this method.In former mesh triangles shape
When number density is larger, the triangle density for cutting face can be very few, may lead to the problem in surface model subsequent processing.It is cutting
When face and the larger angle of former grid, the normal vector calculating of coupling part will appear mutation, cause rendering effect poor.
Fig. 5 is please referred to, tradition cuts the grid that face generating algorithm generates and simply the vertex for cutting generation is connected, cuts
The intersection of face and cropped grid causes rendering effect very poor due to the distortion of method line computation.
Invention content
The technical problem to be solved in the present invention is, in view of the deficiencies of the prior art, it is fast, accurate to provide a kind of processing speed
Good, the high section grid generation method based on surface model for the treatment of effeciency of property.
In order to solve the above technical problems, the present invention adopts the following technical scheme that.
A kind of section grid generation method based on surface model comprising have：Step S1 imports 3D medical images, to 3D
It needs the organ model of detachment to be cut in medical image, obtains cutting face；Step S2, for each triangle, by the inverse time
Needle sequence carries out each edge with the face that cuts to ask friendship, obtains the vertex in the face that cuts and generates the syntople between vertex；Step
Vertex is divided into one or more end to end closed polygon point sets by S3 according to the syntople between vertex and vertex；Step
Each closed polygon point set that step S3 is obtained is denoted as P by rapid S4, each vertex note for taking closed polygon point to concentrate
For p, the direction vector of inner interweaver is taken to be denoted as d, calculates the new summit q that p is obtained along closed polygon internal blas is directed toward,
Then there is q=p+u*d, wherein u is the scalar that numerical value is less than 0.01, and the new summit set being made of later q is denoted as Q, by set P
It is attached according to position and topological relation with the vertex in Q, obtains outer layer triangle strip；Step S5 obtains step S4
Set Q takes the vertex q of wherein interior angle minimum every time, its front and back adjacent two vertex X and Y are formed triangles, and according to point
It splits coefficient μ to decide whether to take the midpoint W of q opposite side, and the triangle is split into two triangles of XqW and qYW, wherein μ=f*
Lavg/Lxy, f are subdivision parameter, and Lavg is the average length on side, and Lxy is the length of side XY；Step S6, obtaining step S5 are obtained
Internal layer grid in all triangular apex, and using the vertex in original collection Q as constraint, adjustment cuts the triangle in face
Distribution and size；Step S7 obtains the section grid of organ model.
Preferably, in the step S5, if division (μ>1) it, then with W substitutes q and participates in next round and calculate, otherwise by q from collection
It closes and is deleted in Q.
Preferably, in the step S5, adjacent two vertex of vertex interior angle that the step is changed and its left and right are updated
Syntople, later carry out next round calculating, until set Q in vertex number be 3, remaining 3 vertex are combined into
Triangle.
Preferably, in the step S6, the Triangle-Profile and size in face are cut using least square method adjustment.
In section grid generation method disclosed by the invention based on surface model, mainly for the grid after cutting into
The triangular mesh that row cuts face generates.The vertex set cut is obtained first and its mutual topological order is closed
System.Then opposite vertexes set is pre-processed, and according to vertex and its syntople, it is more that vertex is divided into one or more closures
Side shape vertex set.For each closed polygon point set P in set, by each vertex to the inside of hole
It carries out the offset that length is d and generates new vertex set Q.Vertex in set P and Q is generated into triangle according to position relationship
Band.Opposite vertexes collection Q chooses the vertex p of wherein interior angle minimum, and p and its front and back adjacent two vertex Y and Z is formed every time
Triangle, and decide whether to take the midpoint W of the longest edge of triangle according to bundle factor μ and the triangle is split into two three
Angular YpW and pZW.If division, the midpoint W of longest edge replaces vertex p to participate in next round calculating, otherwise removes the vertex and collects
Close Q.Each round needs to update the adjoining on two adjacent vertex of interior angle and its left and right on the vertex of epicycle modification after the completion of calculating
Relationship.When vertex quantity is 3 in vertex set Q, remaining 3 vertex are formed into triangle, calculating terminates.It finally, will be upper
The triangle of all generations carries out least square method optimization during stating, and using fix all vertex in original collection Q as
Constraints seeks all optimal locations for cutting all vertex on surface grids.Compared to existing technologies, the present invention is for basis
Grid after CT image reconstructions, the organ that " will be adhered " and the cutting tissue of " hyperplasia " are a kind of common operations, cut surface
Grid formation speed and effect, which handle subsequent grid and observe, great meaning, can effectively improve computer
The efficiency of auxiliary diagnosis.
Description of the drawings
Fig. 1 is the flow chart of section grid generation method of the present invention.
Fig. 2 is the gall-bladder illustraton of model after being cut in preferred embodiment.
Fig. 3 is the result figure for generating two layers of triangle strip.
Fig. 4 is to cut surface grids to generate result figure and optimum results figure.
Fig. 5 is the operation result figure that tradition cuts face generating algorithm.
Specific implementation mode
The present invention is described in more detail with reference to the accompanying drawings and examples.
The section grid generation method based on surface model that the invention discloses a kind of, please refers to Fig. 1 comprising have：
Step S1 imports 3D medical images and is cut out to needing the organ model of detachment to cut in 3D medical images
Section；
Step S2 carries out each edge with the face that cuts friendship, acquisition is asked to cut face counterclockwise for each triangle
Vertex and generate the syntople between vertex；
Vertex is divided into one or more end to end closures by step S3 according to the syntople between vertex and vertex
Polygon point set；
Each closed polygon point set that step S3 is obtained is denoted as P by step S4, takes closed polygon point to concentrate every
One vertex is denoted as p, and the direction vector of inner interweaver is taken to be denoted as d, calculates p and is obtained along closed polygon internal blas is directed toward
New summit q, then have q=p+u*d, wherein u is the scalar that numerical value is less than 0.01, and the new summit set being made of later q is denoted as
Vertex in set P and Q is attached according to position and topological relation, obtains outer layer triangle strip by Q；
Step S5 takes the vertex q of wherein interior angle minimum every time to the set Q that step S4 is obtained, by before and after it adjacent two
A vertex X and Y form triangle, and decide whether according to bundle factor μ to take the midpoint W of q opposite side, and the triangle is split into
Two triangles of XqW and qYW, wherein μ=f*Lavg/Lxy, f are subdivision parameter, and Lavg is the average length on side, and Lxy is side
The length of XY；
All triangular apex in the internal layer grid that step S6, obtaining step S5 are obtained, and with the top in original collection Q
Point cuts the Triangle-Profile and size in face as constraint, adjustment；
Step S7 obtains the section grid of organ model.
In the above method, the triangular mesh for mainly for the grid after cutting cut face generates.It obtains first
Take the vertex set cut and its mutual topological order relationship.Then opposite vertexes set is pre-processed, according to
Vertex is divided into one or more closed polygon vertex sets by vertex and its syntople.For each in set
Each vertex is carried out length as the offset of d to the inside of hole and generates new vertex by closed polygon point set P
Set Q.Vertex in set P and Q is generated into triangle strip according to position relationship.Opposite vertexes collection Q, each selection wherein interior angle is most
Small vertex p, and p and its front and back adjacent two vertex Y and Z are formed into triangle, and decide whether to take according to bundle factor μ
The triangle is simultaneously split into two triangles YpW and pZW by the midpoint W of the longest edge of triangle.If division, in longest edge
Point W replaces vertex p to participate in next round calculating, and the vertex is otherwise removed set Q.Each round needs to update epicycle after the completion of calculating
The syntople on two adjacent vertex of the interior angle on the vertex of modification and its left and right.When vertex quantity is 3 in vertex set Q,
Remaining 3 vertex are formed into triangle, calculating terminates.Finally, the triangle of all generations in the above process is carried out minimum
Square law optimizes, and to fix all vertex in original collection Q as constraints, asks all and cut all tops on surface grids
The optimal location of point.Compared to existing technologies, the present invention is for according to the grid after CT image reconstructions, the organ that " will be adhered "
The cutting tissue of " hyperplasia " is a kind of common operation, the grid formation speed and effect of cut surface for subsequent grid at
Reason and observation have great meaning, can effectively improve the efficiency of computer-aided diagnosis.
As a preferred method, in the step S5, if division (μ>1) it, then substitutes q with W and participates in next round calculating, it is no
Then q is deleted from set Q.
Further, in the step S5, adjacent two tops of vertex interior angle that the step is changed and its left and right are updated
The syntople of point carries out next round calculating later, until the vertex number in set Q is 3, remaining 3 vertex are combined
At triangle.
In the step S6 of the present embodiment, the Triangle-Profile and size in face are cut using least square method adjustment.
In the inventive solutions, cut the stage asks friendship to obtain in each edge and the face of cutting counterclockwise
(generation) vertex is cut by arranged counterclockwise, additional sequence work is carried out without opposite vertexes in subsequent step, improves
Efficiency of algorithm.Meanwhile orderly vertex set is divided into one or more the first connected closed polygon points by pretreatment stage
Set, to carry out section generation respectively to each set.Secondly, one layer is generated to center position to each polygon point set
(or multilayer) narrow triangle strip, the grid this process avoids the face that cuts and the boundary position of cropped grid because cutting face
It is long and narrow and sparse and cause normal calculate generate distortion, cause rendering effect to be deteriorated.Again, when cutting face internal layer grid generation
The cycle of use takes Minimum Internal Angle to carry out triangle generation and decided whether to generating triangle into line splitting according to bundle factor
Algorithm.In addition, cutting the triangle of face generation to internal layer, carried out most by boundary constraint of the vertex in original vertices set Q
Small two multiply the processing method of optimization.
Section grid generation method disclosed by the invention based on surface model can refer to following reality in actual application
Apply example：
First, the acquisition of information cut a little is mainly that basis cuts algorithm, for each triangle, counterclockwise will
It each edge and cuts face and carries out asking friendships, to which acquisition cuts the vertex of generation and quickly generates the neighbour between vertex accordingly in an orderly manner
Connect relationship；
Secondly, according to vertex and its syntople information, it is polygon that vertex is divided into one or more end to end closures
Form point collection；
Later, to each closed polygon point set P that the upper stage obtains, each vertex p is taken, its interior angle is taken
The direction vector d of bisector calculates the new vertex q that p is obtained along closed polygon internal blas is directed toward.Q=p+u*d. its
Middle u is the scalar that numerical value is less than 0.01.Obtain q composition new vertex set Q, by the vertex in set P and Q according to position with
Topological relation is attached, and obtains outer layer triangle strip；
Again, to the vertex set Q obtained on last stage, the vertex q of wherein interior angle minimum is taken every time, it is front and back adjacent
Two vertex X and Y form triangles, and according to bundle factor μ decide whether to take q to side midpoint W and by the triangle
Shape splits into two triangles of XqW and qYW, and (μ=f*Lavg/Lxy, f are subdivision parameter, and Lavg is the average length on side, and Lxy is
The length of side XY).If dividing (μ>1), then W substitutes q and participates in next round calculating, otherwise deletes q from set Q.Update epicycle
Next round calculating is carried out after the syntople on two adjacent vertex of the interior angle on the vertex of modification and its left and right, until in set Q
Vertex number is 3, and remaining 3 vertex are combined into triangle；
In addition, this stage obtains all triangular apex in the internal layer grid that the last stage obtains, and fixed original set
The vertex in Q is closed as constraint, carries out least square method optimization, composition is made to cut the triangle uniform distribution in face, be of moderate size；
Finally, the section grid of model is generated, section grid inside triangle is evenly distributed, no elongated triangular.And
Due to the presence of outermost layer lengths, section part and the vertex scheme vector of grid rest part are excessively gentle, and there is no render
The problem of effect exception.
As the preferred case of the present invention, it is described below and surface grids generating process is cut for gall-bladder model：
Please refer to Fig. 2, to cut after gall-bladder model, cut at face there are hole, need to the hole generate triangle
Shape grid is replenished, that is, cuts the grid generating process in face；
Fig. 3 is please referred to, Fig. 3 is progress outer layer grid (triangle strip) generation as a result, the result shown in figure is made a living
At two layers of triangle strip；
Fig. 4 is please referred to, Fig. 4 (left side) is the result for generating internal layer triangular mesh.By Fig. 4 (in) as it can be seen that generate internal layer
Triangular mesh is unevenly distributed, not of uniform size, and there are more long and narrow triangles.Fig. 4 (right side) is shown to internal layer triangle
Carry out after minimum dichotomy optimization as a result, triangular mesh distribution uniform, size after optimization is approximate and be not present
Extremely long and narrow triangle.
Section grid generation method disclosed by the invention based on surface model, advantageous effect compared to existing technologies
It is, the present invention obtains orderly polygon vertex set in the stage of cutting, and can sort work to avoid the vertex of subsequent process
Make, improves efficiency of algorithm.Meanwhile the present invention first generates one or more narrow triangle during the face that cuts generates
Band, the triangle strip cut the coupling part of surface grids as cropped grid and internal layer, and face generation can be cut to avoid other
Face triangular shaped elongate is cut in algorithm and sparse caused normal calculates rendering effect compromises caused by distortion.Secondly, originally
Invention carries out triangle generation using Minimum Internal Angle, and according to bundle factor decides whether that triangle can be located into line splitting
The case where managing concave polygon and convex polygon, and the quantity of mesh triangles shape can be controlled by adjusting bundle factor, have
The wider scope of application and good flexibility.In addition, the present invention carries out Least-squares minimization to cutting face internal layer triangle, it can
So that internal layer triangle size reaches unanimity, shape is more regular, distribution is more uniform, precision caused by avoiding grid sparse
Calculation amount caused by problem and comparatively dense increases problem, so as to the development of subsequent grid processing work.
The above is preferred embodiments of the present invention, is not intended to restrict the invention, all technology models in the present invention
Interior done modification, equivalent replacement or improvement etc. are enclosed, should be included in the range of of the invention protect.
Claims (4)
1. a kind of section grid generation method based on surface model, which is characterized in that include：
Step S1 imports 3D medical images and is cut to needing the organ model of detachment to cut in 3D medical images
Face；
Each edge is carried out asking friendship counterclockwise with the face that cuts, obtains the top in the face that cuts by step S2 for each triangle
It puts and generates the syntople between vertex；
It is polygon to be divided into one or more end to end closures according to the syntople between vertex and vertex by step S3 for vertex
Form point collection；
Each closed polygon point set that step S3 is obtained is denoted as P by step S4, takes closed polygon point is concentrated each
Vertex is denoted as p, and the direction vector of inner interweaver is taken to be denoted as d, and calculating p obtains new along direction closed polygon internal blas
Vertex q, then have q=p+u*d, wherein u is the scalar that numerical value is less than 0.01, and the new summit set being made of later q is denoted as Q, will
Vertex in set P and Q is attached according to position and topological relation, obtains outer layer triangle strip；
Step S5 takes the vertex q of wherein interior angle minimum every time to the set Q that step S4 is obtained, by its front and back two adjacent top
Point X and Y form triangle, and decide whether according to bundle factor μ to take the midpoint W of q opposite side, and the triangle is split into XqW
With two triangles of qYW, wherein μ=f*Lavg/Lxy, f are subdivision parameter, and Lavg is the average length on side, and Lxy is side XY's
Length；
All triangular apex in the internal layer grid that step S6, obtaining step S5 are obtained, and made with the vertex in original collection Q
For constraint, adjustment cuts the Triangle-Profile and size in face；
Step S7 obtains the section grid of organ model.
2. the section grid generation method based on surface model as described in claim 1, which is characterized in that in the step S5,
If dividing (μ>1) it, then substitutes q with W and participates in next round calculating, otherwise delete q from set Q.
3. the section grid generation method based on surface model as described in claim 1, which is characterized in that in the step S5,
The syntople on two adjacent vertex of vertex interior angle and its left and right that the step is changed is updated, carries out next round meter later
It calculates, until the vertex number in set Q is 3, remaining 3 vertex is combined into triangle.
4. the section grid generation method based on surface model as described in claim 1, which is characterized in that in the step S6,
The Triangle-Profile and size in face are cut using least square method adjustment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810334622.6A CN108564635A (en) | 2018-04-14 | 2018-04-14 | A kind of section grid generation method based on surface model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810334622.6A CN108564635A (en) | 2018-04-14 | 2018-04-14 | A kind of section grid generation method based on surface model |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108564635A true CN108564635A (en) | 2018-09-21 |
Family
ID=63535067
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810334622.6A Pending CN108564635A (en) | 2018-04-14 | 2018-04-14 | A kind of section grid generation method based on surface model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108564635A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130085774A1 (en) * | 2011-10-04 | 2013-04-04 | Yuanming Chen | Semi-automated or fully automated, network and/or web-based, 3d and/or 4d imaging of anatomy for training, rehearsing and/or conducting medical procedures, using multiple standard x-ray and/or other imaging projections, without a need for special hardware and/or systems and/or pre-processing/analysis of a captured image data |
| CN107578415A (en) * | 2017-10-10 | 2018-01-12 | 深圳市图智能科技有限公司 | A kind of medical image cutting method and device |
| CN107886575A (en) * | 2017-11-14 | 2018-04-06 | 辽宁工程技术大学 | A kind of method that open-pit mine stope triangular mesh cuts coal seam quadrilateral mesh |
-
2018
- 2018-04-14 CN CN201810334622.6A patent/CN108564635A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130085774A1 (en) * | 2011-10-04 | 2013-04-04 | Yuanming Chen | Semi-automated or fully automated, network and/or web-based, 3d and/or 4d imaging of anatomy for training, rehearsing and/or conducting medical procedures, using multiple standard x-ray and/or other imaging projections, without a need for special hardware and/or systems and/or pre-processing/analysis of a captured image data |
| CN107578415A (en) * | 2017-10-10 | 2018-01-12 | 深圳市图智能科技有限公司 | A kind of medical image cutting method and device |
| CN107886575A (en) * | 2017-11-14 | 2018-04-06 | 辽宁工程技术大学 | A kind of method that open-pit mine stope triangular mesh cuts coal seam quadrilateral mesh |
Non-Patent Citations (8)
| Title |
|---|
| 于素平: "含内部孔洞的面模型虚拟切割仿真研究", 《中国优秀硕士学位论文全文数据库（电子期刊）》 * |
| 付成华等: "多介质复杂区域四边形网格自动剖分算法及应用", 《长江科学院院报》 * |
| 李宗领等: "平面区域有限元三角网格迭代优化方法", 《新型工业化》 * |
| 王志宏等: "一种基于地质界面的三维模型裁剪法", 《辽宁工程技术大学学报》 * |
| 谢倩茹等: "三维模型孔洞修补方法的研究", 《计算机应用研究》 * |
| 陈杰，等: "三角网格曲面孔洞修补算法", 《计算机集成制造系统》 * |
| 高旋辉，等: "一种基于三角网格模型的空洞填补方法", 《计算机应用与软件》 * |
| 高福顺等: "三角网格中的孔洞修补算法", 《吉林大学学报(理学版)》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Manmadhachary et al. | Improve the accuracy, surface smoothing and material adaption in STL file for RP medical models | |
| US7747305B2 (en) | Computer-aided-design of skeletal implants | |
| CN110189352B (en) | Tooth root extraction method based on oral cavity CBCT image | |
| US10346504B2 (en) | 3D modelling of bodies | |
| CN105931291B (en) | A kind of complete dental modeling method of digitlization | |
| US9013480B2 (en) | Methods and systems for generating and editing surfaces | |
| CN107874831B (en) | Skull-jaw face guide plate design method based on implicit function | |
| CN108629839A (en) | The method for obtaining full dental cast using the oral cavity CT images under dental articulation state | |
| CN103156693B (en) | Manufacturing method of tooth implantation operation guide plate based on body image processing | |
| CN110246586A (en) | A kind of finite element model method for building up of the preoperative emulation of liver tumour microwave ablation | |
| CN105608744B (en) | The internal void design method of imitative period minimal surface based on tetrahedral grid | |
| CN108510580A (en) | A kind of vertebra CT image three-dimensional visualization methods | |
| CN112998888B (en) | False tooth model undercut removing method based on grid projection | |
| Wang et al. | A marching cube algorithm based on edge growth | |
| Qiu et al. | An efficient and collision-free hole-filling algorithm for orthodontics | |
| CN108564635A (en) | A kind of section grid generation method based on surface model | |
| CN107967682B (en) | Two-point grid model cutting method | |
| CN111105476A (en) | Three-dimensional reconstruction method for CT image based on Marching Cubes | |
| Ameddah et al. | Bio-CAD reverse engineering of free-form surfaces by planar contours | |
| CN115294264A (en) | Orthopedic operation guide plate design method | |
| Yang et al. | Interactive tooth segmentation method of dental model based on geodesic | |
| Stanojevic et al. | Advanced investigation on rapid prototyping techniques in maxillofacial surgery and implanting preparation | |
| Yang et al. | Three-dimensional solid reconstruction of femoral CT images based on reverse engineering | |
| KR20010039186A (en) | Method for constructing 3 dimensional finite element model of somatic structure | |
| CN107689253B (en) | Method for generating parameterized inner surface of false tooth crown |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180921 |