CN104167020A - Spatial reversed curved surface reconstruction method based on restraint Delaunay triangular mesh - Google Patents
Spatial reversed curved surface reconstruction method based on restraint Delaunay triangular mesh Download PDFInfo
- Publication number
- CN104167020A CN104167020A CN201410410078.0A CN201410410078A CN104167020A CN 104167020 A CN104167020 A CN 104167020A CN 201410410078 A CN201410410078 A CN 201410410078A CN 104167020 A CN104167020 A CN 104167020A
- Authority
- CN
- China
- Prior art keywords
- coordinate
- space
- triangulation network
- site
- layer
- 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.)
- Granted
Links
Abstract
The invention discloses a spatial reversed curved surface reconstruction method based on a restraint Delaunay triangular mesh. The spatial reversed curved surface reconstruction method based on the restraint Delaunay triangular mesh comprises the following steps of processing of horizon data, linking of the restraint triangular mesh, recovery of a spatial triangular mesh and drawing of a spatial reversed curved surface. The spatial reversed curved surface reconstruction method based on the restraint Delaunay triangular mesh has the advantages that due to the fact that the triangular mesh mode based on the restraint Delaunay is adopted, the requirements for the horizon data are lowered, rapid display of the data is guaranteed, the constraint and the boundary of the geological curved surface are well showed, and the spatial reversed curved surface reconstruction method based on the restraint Delaunay triangular mesh has high adaptability when the method is used for three-dimensional geological modeling and two-dimensional drawing.
Description
Technical field
The invention belongs to space curved surface reconstruction technique field, relate in particular to a kind of space reversing curve reestablishing method based on the constraint Delaunay triangulation network.
Background technology
The surface reconstruction of spatial point is an ingredient in three-dimensional geological modeling, is to use computer technology, carries out curve reestablishing, and its essence is to utilize discrete point in three dimensions to connect in certain sequence the problem of curved surface.The research that layer position rebuilds for the some cloud reconstruction layer position based on point can solve petroleum prospecting problem, has important theory value and practice significance.According to the difference that realizes the method for curve reestablishing, existing space Based Model for Reconstructing Geological Surface technology can be divided into several classes below: (1) parametric surface is rebuild: common parametric surface technology, mainly comprises the curved surface disposal route of interpolation and matching.Surface interpolation is strictly by given data point, to carry out constructing curve, and according to raw data point value, carrys out the value of interpolation clear area, and these class methods do not change raw data point value.Surface fitting is that curved surface is learned on the ground that utilizes relatively simple mathematics curved surface to be similar to complex structure, according to certain mathematics criterion, makes given mathematics curved surface approach to greatest extent geological surface or builds a face by these original point.Main surface interpolation method has by anomalistic distance method of weighted mean, by orientation, gets a weighted method, inverse distance weighted method, bilinear interpolation, Kriging method of interpolation and up-to-date discrete smooth interpolation technology.And curved surface fitting method mainly contains bicubic spline function method of interpolation, Curved Surface Spline Function method of interpolation and Curved Surface Smoothing method of interpolation etc.Also comprise some other parametric surface method, such as Loop subdivision curved surface and butterfly subdivision curved surface method etc. simultaneously.(1) grid surface is rebuild: grid surface is rebuild and made again burst linear surface rebuild, its principle is infinitely to approach with many very tiny triangle surfaces the curved surface that needs reconstruct, and triangular mesh curved surface is visual easier for Computerized three-dimensional, so the form of now a lot of deal with data is all triangle.At present, the most common grid surface reconstruction mode is the structure of the Delaunay triangulation network and Voronoi figure.These methods can be reduced geological surface largely according to geological information.(3) Implicit Surface Reconstruction: the curved surface that needs are rebuild expresses by the mode of implicit expression function the Implicit Surface Reconstruction method of crying.The closed curve curved surface that can very easily represent many-valued curve and surface with implicit function, so the method for the Implicit Surface Reconstruction curved surface study hotspot that becomes people gradually, and got larger effect.Implicit surface is more and more subject to international scholar's attention in recent years, becomes a kind of important representation of a surface method.It has irreplaceable advantage in the curve reestablishing problem of structure topological structure complexity.Yet due to the complicacy of geological surface multiple constraint, the application of implicit surface in geology is not extensive.Triangle is a kind of simplex of two-dimensional space, can utilize it to express X-Y scheme arbitrarily, and so a kind of mesh generation technology has just had sufficient dirigibility.Nowadays, various triangle gridding subdivision technology has obtained corresponding application in every field.Delaunay triangulation is the triangulation of optimizing, the most representative in triangulation.At present, the Delaunay triangulation network has become the basis of many space curved surface model constructions, and in building, the different engineering applications such as geology have obtained a large amount of application.Although utilize the Delaunay triangulation network can guarantee that the whole triangulation network reaches standard as far as possible, can not pass through oversize landform, but in geology practical application, also can there is the special restriction relation as fracture line, the Delaunay Triangulation Network Model generating out in this case can not represent real geologic model exactly, is also difficult to meet the demand of many actual GEOLOGICAL APPLICATION.So, can, in the generative process of the Delaunay triangulation network, add some necessary restriction relations just to become a very crucial technology.For the constraint Delaunay triangulation network, still wish that it can keep the advantageous property of the Delaunay triangulation network.Because, so both can meet the code requirement of grid, also met user of service to the analysis of geologic model and operational requirements simultaneously.Reversing geological surface is a kind of geologic structure of complexity, is the distinctive a kind of geological phenomenon in China's western region.Its essence is a kind of upturning of beds fold, and stratum fold and tomography mainly all cause by tectonic stress, and difference is that tomography is that tectonic stress is greater than formation fracture intensity and forms; When being less than formation fracture intensity, tectonic stress can only form structure deformation---fold.Due to the complicacy of reversing geological surface, there is not tomography in reversing geological surface, but most region exists multiple value.Common Delaunay triangulation, the many-valued curved surface for this complexity of reversing geological surface, often isolates into by continuous bad ground the piecemeal not being associated, and the actual conditions that this does not meet stratum, are difficult to complete smoothly curve reestablishing.For there is no the discrete point of constraint condition, the algorithm of Delaunay triangulation is very ripe, but after introducing constraint condition, its subdivision algorithm or a study hotspot, be not very ripe.For the constraint triangulation network, in three-dimensional geological modeling application, Hao Haisen etc. utilize the three dimensions solid model that builds stratum base plate containing the Delaunay TIN of Condition of Strong Constraint; Sub minute of the employing regions such as Cai Qiang and interlock subdivision algorithm have been realized the restriction Delaunay triangulation of Geological Structure with Overlapping Domains; Chen Yongfeng etc. detect scheduling algorithm to traditional convex closure generation, triangulation and empty circumscribed circle and improve, and geology face is carried out to Delaunay triangulation; Meng Yongdong etc. generate respectively the TIN model of stratum, fracture, boundary line class geologic structure according to belt restraining Delaunay triangulation, amalgamation forms the whole three-dimensional geological model of engineering.Due to varying of application problem, data volume varies in size, also different to successional requirement, does not have a kind of algorithm to be applicable to all occasions.And reversing geological surface is due to the complicacy in its geologic structure, also there is no at present the applicable curve reestablishing method based on Constrained Delaunay triangulation.
Summary of the invention
In order to overcome the above problems, the present invention proposes a kind of space reversing curve reestablishing method based on the constraint Delaunay triangulation network.
Technical scheme of the present invention is:: a kind of space reversing curve reestablishing method based on the constraint Delaunay triangulation network, comprises the following steps:
S1. luv space reversing lth layer site is processed, by original horizon flattening, makes multiple value data-switching become substance Value Data, specifically comprise the following steps:
S11. in luv space reversing lth layer bit data, survey line is set, obtains the original inverted position data under original layers bit data and every survey line, preserve the luv space coordinate in layer site;
S12. space reversing lth layer bit data is shone upon, under every survey line, space coordinates (x, y, z) is mapped to survey line coordinate system (cdp, z),
Wherein, cdp is the transverse coordinate axis of survey line coordinate system, and z is the along slope coordinate axle of survey line coordinate system;
S13. the layer bit data under survey line coordinate system processed, obtained and preserve the value of flex point;
S14. original layers bit data is carried out to staging treating according to flex point, make each section not have multiple value;
S15. successively the segment data in step S14 is evened up to processing, make original layers bit data not have heavily value;
S16. the layer site survey line coordinate after evening up is mapped to space coordinates, obtains and preserve the volume coordinate after even up in layer site.
S2. utilize constraint Delaunay triangulation network building method, topological link is carried out in all layers site after evening up, obtain unbent plane trigonometry net;
S3. by the triangular apex of the plane trigonometry net obtaining in the layer site luv space coordinate substitution step S2 preserving in step S11, obtain the space reversing triangulation network;
S4. according to the space reversing triangulation network obtaining in step S3, rendering space reversing curved surface.
Further, in above-mentioned steps S15, evening up processing specifically comprises the following steps:
S151. keep the coordinate in each layer of site in the first segment data constant;
S152. the z value of each layer of site coordinate in the second segment data is remained unchanged, change the cdp value of layer site coordinate;
S153. handle after the second segment data, the 3rd segment data is processed according to step S152, complete successively the processing to all segment datas.
Further, above-mentioned steps S2 utilizes constraint Delaunay triangulation network building method, and topological link is carried out in all layers site after evening up, and obtains unbent plane trigonometry netting gear body and comprises the following steps:
S21. according to the flex point data in step S13, corresponding flex point under each survey line is carried out to line, form the Delaunay triangulation network;
S22. travel through all binding sides, the constraint line segment particular section not being present in the Delaunay triangulation network is processed, all constraint line segments are all appeared in the Delaunay triangulation network;
S23. topological link is carried out a little in layer position, obtain unbent plane trigonometry net.
The invention has the beneficial effects as follows: the space reversing curve reestablishing method based on the constraint Delaunay triangulation network of the present invention adopts the triangle gridding mode based on constraint Delaunay, reduced the requirement to layer bit data, guaranteed the quick demonstration of data, good performance constraint and the border of geological surface, in the application of three-dimensional geological modeling and two-dimensional layer iso-surface patch, there is good adaptability.
Accompanying drawing explanation
Fig. 1 is the space reversing curve reestablishing method schematic flow sheet based on the constraint Delaunay triangulation network of the present invention.
Fig. 2 is luv space geologic horizon data distribution schematic diagram of the present invention.
Fig. 3 is the layer bit data distribution schematic diagram under a survey line of the present invention.
Fig. 4 is that under a survey line of the present invention, inverted position data are evened up process schematic diagram.
Fig. 5 be under a survey line of the present invention corresponding flex point line as constraint schematic diagram.
Fig. 6 is Delaunay Triangle Network Structure schematic diagram of the present invention.
Fig. 7 is that plane trigonometry network recovery of the present invention becomes space triangular net schematic diagram.
Fig. 8 is space reversing triangulation network design sketch of the present invention.
Fig. 9 is space reversing curved surface design sketch of the present invention.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearer, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein, only in order to explain the present invention, is not intended to limit the present invention.
As shown in Figure 1, be the space reversing curve reestablishing method schematic flow sheet based on the constraint Delaunay triangulation network of the present invention.The present invention is by first evening up curved surface original value to without the heavy state of value, layer bit data after evening up carried out to Constrained Delaunay triangulation and build topology, finally the belt restraining Delaunay triangulation network of plane is recovered, obtain the triangulation network of space reversing, finally the reversing triangulation network is drawn, realize the reconstruction of reversing geological surface, specifically comprise the following steps:
S1. luv space reversing lth layer site is processed, by original horizon flattening, makes multiple value data-switching become substance Value Data, specifically comprise the following steps:
S11. in luv space reversing lth layer bit data, survey line is set, obtains the original inverted position data under original layers bit data and every survey line, preserve the luv space coordinate in layer site.
As shown in Figure 2, be luv space geologic horizon data distribution schematic diagram of the present invention.By survey line is set, original geological stratification bit data is distributed on survey line, as shown in solid line in Fig. 2.Under every survey line, layer bit data all presents crooked reversing state, as shown in phantom in Figure 2.By survey line, layer bit data analyzed, obtained the original inverted position data under original layers bit data and every survey line, preserve the luv space coordinate in layer site.The layer position here refers to a certain ad-hoc location in succession of strata, and the layer position on stratum can be the boundary line of stratigraphic unit, can be also the reference lamina etc. that belongs to a certain specific epoch.Survey line is the line of observation of the observation station composition that chi is arranged along straight line by a certain percentage, with this, obtains geologic data.
S12. space reversing lth layer bit data is shone upon, under every survey line, space coordinates (x, y, z) is mapped to survey line coordinate system (cdp, z),
Wherein, cdp is the transverse coordinate axis of survey line coordinate system, and z is the along slope coordinate axle of survey line coordinate system.
For convenient, process, we are mapped as planar coordinate by 3 d space coordinate on every survey line.Wherein, 3 d space coordinate is (x, y, z), planar coordinate system, and survey line coordinate is (cdp, z).As shown in Figure 3, be the layer bit data distribution schematic diagram under a survey line of the present invention.Under the coordinate system of every survey line, two coordinate directions are respectively cdp direction and z direction.The basic road collection form that the cdp here adopts while being geological data processing, is called cdp road collection.Also be that space geologic data is mapped to one of coordinate in plane.The coordinate system mapping method here uses extensively in existing practical application, does not describe in detail herein.
S13. the layer bit data under survey line coordinate system processed, obtained and preserve the value of flex point.
According to the layer bit data that is mapped to survey line coordinate system in step S12, whether judgement layer site is flex point, and obtains the value of flex point.Here the determination methods of flex point is: establish this layer of site for an A, the point on the some A left side and the right is respectively a B and some C, comparison point A and some B, some A and the coordinate figure size of some C in cdp direction, if some B is greater than an A and some C is greater than an A, or some B is less than an A and some C is less than an A, putting A is flex point, otherwise some A is not flex point.The flex point here refers to and changes the curve point of direction up or down.
S14. original layers bit data is carried out to staging treating according to flex point, make each section not have multiple value.
As shown in Figure 4, for inverted position data under a survey line of the present invention are evened up process schematic diagram.As shown in (1) in Fig. 4, the layer bit data under a survey line is divided into 5 sections with A, B, C, 4 of D.
S15. successively the segment data in step S14 is evened up to processing, make original layers bit data not have heavily value.
The processing of evening up here specifically comprises the following steps:
S151. keep the coordinate in each layer of site in the first segment data constant.
S152. the z value of each layer of site coordinate in the second segment data is remained unchanged, change the cdp value of layer site coordinate.
What set N section is some some M, and the point after some M evens up is some M
1, the last point of N-1 section is some L, the point after some L evens up is a L
1, the survey line coordinate of some M is (m
c, m
z), some M
1survey line coordinate be (m
c1, m
z1), the survey line coordinate of some L is (l
c, l
z), some L
1survey line coordinate be (l
c1, l
z1).The relational expression of each point survey line coordinate is:
m
c1=l
c1+abs(m
c-l
c),
m
z1=m
z
Wherein, abs is absolute value sign.If (2) in Fig. 4 are to as shown in (5), the process of segment data being processed for the present invention.
S153. handle after the second segment data, the 3rd segment data is processed according to step S152, complete successively the processing to all segment datas.
S16. the layer site survey line coordinate after evening up is mapped to space coordinates, obtains and preserve the volume coordinate after even up in layer site.
By evening up cdp coordinate and the z coordinate in rear layer site, be mapped to space actual coordinates, obtain evening up the actual position coordinate in rear layer site.
S2. utilize constraint Delaunay triangulation network building method, topological link carried out a little in the layer position after evening up, obtain unbent plane trigonometry net, specifically comprise the following steps:
S21. according to the flex point data in step S13, corresponding flex point under each survey line is carried out to line, form the Delaunay triangulation network.
As shown in Figure 5, for corresponding flex point line under a survey line of the present invention is as constraint schematic diagram.Here the present invention adopts constraint algorithm of subdivision, and binding side is segmented to the processing of adding some points, and the point set of all original point, only as the final subset that generates the point set of the triangulation network, is made the present invention have better adaptability, and has been easy to the structure of the triangulation network.
S22. travel through all binding sides, the constraint line segment particular section not being present in the Delaunay triangulation network is processed, all constraint line segments are all appeared in the Delaunay triangulation network.
In the Delaunay triangulation network forming in step S21, constraint line segment might not be present in this triangulation network, therefore need to carry out staging treating to the line segment not being present in this triangulation network.Here the present invention adopts particular section to process, and constantly on the constraint line segment not being present in the triangulation network, inserts mid point, until all constraint line segments appear in the triangulation network.When the line segment in any constraint line segment aggregate has all appeared in existing triangulation, algorithm finishes.
S23. topological link is carried out a little in layer position, obtain unbent plane trigonometry net.
As shown in Figure 6, be Delaunay Triangle Network Structure schematic diagram of the present invention.The layer bit data of evening up after processing carried out to triangulation network topological link, obtain unbent plane trigonometry net.
S3. by the triangular apex of the plane trigonometry net obtaining in the layer site luv space coordinate substitution step S2 preserving in step S11, obtain the space reversing triangulation network.
As shown in Figure 7, for plane trigonometry network recovery of the present invention becomes space triangular net schematic diagram.As shown in Figure 8, be space reversing triangulation network design sketch of the present invention.Unbent plane trigonometry net by obtaining in the layer site luv space coordinate substitution step S23 preserving in step S11, obtains the space reversing triangulation network.
S4. according to the space reversing triangulation network obtaining in step S3, rendering space reversing curved surface.
As shown in Figure 9, be space reversing curved surface design sketch of the present invention.According to the space reversing triangulation network obtaining in step S3, draw, just can obtain space reversing curved surface.
Those of ordinary skill in the art will appreciate that, embodiment described here is in order to help reader understanding's principle of the present invention, should be understood to that protection scope of the present invention is not limited to such special statement and embodiment.Those of ordinary skill in the art can make various other various concrete distortion and combinations that do not depart from essence of the present invention according to these technology enlightenments disclosed by the invention, and these distortion and combination are still in protection scope of the present invention.
Claims (3)
1. the space reversing curve reestablishing method based on the constraint Delaunay triangulation network, is characterized in that, comprises the following steps:
S1. luv space reversing lth layer site is processed, by original horizon flattening, makes multiple value data-switching become substance Value Data, specifically comprise the following steps:
S11. in luv space reversing lth layer bit data, survey line is set, obtains the original inverted position data under original layers bit data and every survey line, preserve the luv space coordinate in layer site;
S12. space reversing lth layer bit data is shone upon, under every survey line, space coordinates (x, y, z) is mapped to survey line coordinate system (cdp, z),
Wherein, cdp is the transverse coordinate axis of survey line coordinate system, and z is the along slope coordinate axle of survey line coordinate system;
S13. the layer bit data under survey line coordinate system processed, obtained and preserve the value of flex point;
S14. original layers bit data is carried out to staging treating according to flex point, make each section not have multiple value;
S15. successively the segment data in step S14 is evened up to processing, make original layers bit data not have heavily value;
S16. the layer site survey line coordinate after evening up is mapped to space coordinates, obtains and preserve the volume coordinate after even up in layer site;
S2. utilize constraint Delaunay triangulation network building method, topological link is carried out in all layers site after evening up, obtain unbent plane trigonometry net;
S3. by the triangular apex of the plane trigonometry net obtaining in the layer site luv space coordinate substitution step S2 preserving in step S11, obtain the space reversing triangulation network;
S4. according to the space reversing triangulation network obtaining in step S3, rendering space reversing curved surface.
2. the space reversing curve reestablishing method based on the constraint Delaunay triangulation network as claimed in claim 1, is characterized in that: in described step S15, even up processing and specifically comprise the following steps:
S151. keep the coordinate in each layer of site in the first segment data constant;
S152. the z value of each layer of site coordinate in the second segment data is remained unchanged, change the cdp value of layer site coordinate;
S153. handle after the second segment data, the 3rd segment data is processed according to step S152, complete successively the processing to all segment datas.
3. the space reversing curve reestablishing method based on the constraint Delaunay triangulation network as claimed in claim 1, it is characterized in that: described step S2 utilizes constraint Delaunay triangulation network building method, topological link is carried out in all layers site after evening up, obtains unbent plane trigonometry netting gear body and comprise the following steps:
S21. according to the flex point data in step S13, corresponding flex point under each survey line is carried out to line, form the Delaunay triangulation network;
S22. travel through all binding sides, the constraint line segment particular section not being present in the Delaunay triangulation network is processed, all constraint line segments are all appeared in the Delaunay triangulation network;
S23. topological link is carried out in all layers site, obtain unbent plane trigonometry net.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410410078.0A CN104167020B (en) | 2014-08-19 | 2014-08-19 | Spatial reversed curved surface reconstruction method based on restraint Delaunay triangular mesh |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410410078.0A CN104167020B (en) | 2014-08-19 | 2014-08-19 | Spatial reversed curved surface reconstruction method based on restraint Delaunay triangular mesh |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104167020A true CN104167020A (en) | 2014-11-26 |
CN104167020B CN104167020B (en) | 2017-02-22 |
Family
ID=51910810
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410410078.0A Expired - Fee Related CN104167020B (en) | 2014-08-19 | 2014-08-19 | Spatial reversed curved surface reconstruction method based on restraint Delaunay triangular mesh |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104167020B (en) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104821015A (en) * | 2015-05-27 | 2015-08-05 | 山东理工大学 | Method for reconstructing alpha-shape curved surface topology of object surface sample point |
CN106296823A (en) * | 2016-08-11 | 2017-01-04 | 北京建筑大学 | Curve reestablishing algorithm based on three-dimensional Ronny Di's triangular network |
CN106504328A (en) * | 2016-10-27 | 2017-03-15 | 电子科技大学 | A kind of complex geological structure modeling method reconstructed based on sparse point cloud surface |
CN107622530A (en) * | 2017-10-10 | 2018-01-23 | 中国地质大学(武汉) | A kind of triangulation network cutting method of efficiently robust |
CN109308738A (en) * | 2018-07-26 | 2019-02-05 | 华南理工大学 | Plant microstructure method for reconstructing based on optimization Delaunay Triangulation |
CN112802194A (en) * | 2021-03-31 | 2021-05-14 | 电子科技大学 | Nuclear facility high-precision reconstruction method based on point cloud data |
CN113140027A (en) * | 2020-01-16 | 2021-07-20 | 浙江碧晟环境科技有限公司 | Construction method of four-dimensional water body model |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH09274668A (en) * | 1996-04-08 | 1997-10-21 | Canon Inc | Method and device for reconstituting three-dimensional object surface |
CN102831647A (en) * | 2012-08-06 | 2012-12-19 | 电子科技大学 | Delaunay triangulation network subdividing method based on space curved surface constraint |
CN103412331A (en) * | 2013-08-30 | 2013-11-27 | 电子科技大学 | Automatic extraction method for three-dimensional earthquake fault |
CN103489222A (en) * | 2013-09-06 | 2014-01-01 | 电子科技大学 | Target body surface reconstruction method in three-dimensional image |
CN103500468A (en) * | 2013-09-09 | 2014-01-08 | 电子科技大学 | Space curved surface reconstruction method based on boundary constraint |
-
2014
- 2014-08-19 CN CN201410410078.0A patent/CN104167020B/en not_active Expired - Fee Related
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH09274668A (en) * | 1996-04-08 | 1997-10-21 | Canon Inc | Method and device for reconstituting three-dimensional object surface |
CN102831647A (en) * | 2012-08-06 | 2012-12-19 | 电子科技大学 | Delaunay triangulation network subdividing method based on space curved surface constraint |
CN103412331A (en) * | 2013-08-30 | 2013-11-27 | 电子科技大学 | Automatic extraction method for three-dimensional earthquake fault |
CN103489222A (en) * | 2013-09-06 | 2014-01-01 | 电子科技大学 | Target body surface reconstruction method in three-dimensional image |
CN103500468A (en) * | 2013-09-09 | 2014-01-08 | 电子科技大学 | Space curved surface reconstruction method based on boundary constraint |
Non-Patent Citations (3)
Title |
---|
NIU WENJIE: "Study on Method of Layer Modelling in Geological Body Visualization", 《INTELLIGENCE COMPUTATION AND EVOLUTIONARY COMPUTATION》 * |
聂小燕: "基于边界约束的空间复杂曲面重构算法", 《计算机应用研究》 * |
蒋晓路 等: "基于曲面约束的地质层面重构方法研究", 《计算机应用研究》 * |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104821015A (en) * | 2015-05-27 | 2015-08-05 | 山东理工大学 | Method for reconstructing alpha-shape curved surface topology of object surface sample point |
CN104821015B (en) * | 2015-05-27 | 2018-06-01 | 山东理工大学 | Surface sampling point α-shape curved surface topology rebuilding methods in kind |
CN106296823A (en) * | 2016-08-11 | 2017-01-04 | 北京建筑大学 | Curve reestablishing algorithm based on three-dimensional Ronny Di's triangular network |
CN106504328A (en) * | 2016-10-27 | 2017-03-15 | 电子科技大学 | A kind of complex geological structure modeling method reconstructed based on sparse point cloud surface |
CN107622530A (en) * | 2017-10-10 | 2018-01-23 | 中国地质大学(武汉) | A kind of triangulation network cutting method of efficiently robust |
CN107622530B (en) * | 2017-10-10 | 2020-05-22 | 中国地质大学(武汉) | Efficient and robust triangulation network cutting method |
CN109308738A (en) * | 2018-07-26 | 2019-02-05 | 华南理工大学 | Plant microstructure method for reconstructing based on optimization Delaunay Triangulation |
CN109308738B (en) * | 2018-07-26 | 2020-09-22 | 华南理工大学 | Plant microstructure reconstruction method based on optimized Delaunay triangulation |
CN113140027A (en) * | 2020-01-16 | 2021-07-20 | 浙江碧晟环境科技有限公司 | Construction method of four-dimensional water body model |
CN113140027B (en) * | 2020-01-16 | 2022-07-15 | 浙江碧晟环境科技有限公司 | Construction method of four-dimensional water body model |
CN112802194A (en) * | 2021-03-31 | 2021-05-14 | 电子科技大学 | Nuclear facility high-precision reconstruction method based on point cloud data |
CN112802194B (en) * | 2021-03-31 | 2023-09-19 | 电子科技大学 | Nuclear facility high-precision reconstruction method based on point cloud data |
Also Published As
Publication number | Publication date |
---|---|
CN104167020B (en) | 2017-02-22 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104167020A (en) | Spatial reversed curved surface reconstruction method based on restraint Delaunay triangular mesh | |
Pellerin et al. | Automatic surface remeshing of 3D structural models at specified resolution: A method based on Voronoi diagrams | |
CN102831647B (en) | Delaunay triangulation network subdividing method based on space curved surface constraint | |
Gong et al. | Three-dimensional modeling and application in geological exploration engineering | |
CN104240300B (en) | Large-scale point cloud complex space curved surfaces reconstructing method based on distributed parallel | |
Ming et al. | GSIS: A 3D geological multi-body modeling system from netty cross-sections with topology | |
CN104966317B (en) | A kind of three-dimensional method for automatic modeling based on ore body contour line | |
CN102867330B (en) | Region-division-based spatial complex horizon reconstruction method | |
CN111968231A (en) | Three-dimensional stratum modeling method based on geological map section | |
CA3065179A1 (en) | Constructing structural models of the subsurface | |
CN106844871A (en) | Three-dimensional geotechnical engineering investigation information model construction method based on BIM | |
CN102867332B (en) | Based on the multistage subdivided meshes curved surface fitting method of complex boundary constraint | |
CN116152461B (en) | Geological modeling method, device, computer equipment and computer readable storage medium | |
CN102881048B (en) | Point cloud clipping-based generation method for spatial curved surface | |
Zheng et al. | A morphologically preserved multi-resolution TIN surface modeling and visualization method for virtual globes | |
CN107464287A (en) | Surface Reconstruction based on multiple-objection optimization | |
Zu et al. | Overview of three-dimensional geological modeling technology | |
CN102609614B (en) | Excavation analysis method aiming at complex ore body | |
Toor et al. | Boundary aligned grid generation in three dimensions and CVD-MPFA discretization | |
de Oliveira Miranda et al. | Finite element mesh generation for subsurface simulation models | |
CN1797035A (en) | Technique for reconstructing 3D complex geologic body | |
Wang et al. | Representing the geological body heterogeneous property field using the quadratic generalized tri-prism volume function model (QGTPVF) | |
Sun et al. | Adaptive Interpolation Method for Generalized Triangular Prism (GTP) Geological Model Based on the Geometric Smoothness Rule | |
Zhang et al. | An automatic unified modeling method of geological object and engineering object based on tri-prism (TP) | |
Dong et al. | Study on 3D Modeling of Complex Coal Mine Interface |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170222 Termination date: 20190819 |
|
CF01 | Termination of patent right due to non-payment of annual fee |