A method and system for anti-aliasing the boundary of a raster geological model

Abstract

The present invention discloses a method for anti-aliasing the border of a raster geological model, comprising the following steps: S1: generating two layers of Delaunay triangulation models with the same longitude and latitude but different elevations according to the range of the geological structure model; S2: obtaining triangular facets that need to be anti-aliased; S3: anti-aliasing the border triangular facets; S4: anti-aliasing the internal triangular facets; S5: model visualization; S6: geological analysis application. The present invention also discloses a system for anti-aliasing the border of a raster geological model, comprising a triangulation generation module, an anti-aliased facet acquisition module, an anti-aliasing processing module, a visualization module and an analysis application module. The present invention improves the smoothing effect of the border of a three-dimensional geological model, and the algorithm processing results meet the characteristics of horizontal continuity of rock layers and the requirements of rationality and consistency of superposition; the algorithm formula is programmed and the open source WebGL technology is adopted to achieve efficient visualization of the results and realize a variety of geological analysis functions.

Description

Technical Field

[0001] The present invention relates to the technical field of three-dimensional geological modeling, and in particular to a method and system for anti-aliasing the boundary of a grid geological model. Background Art

[0002] In recent years, 3D geological modeling has been widely used in many fields such as urban construction and geotechnical engineering, and has become an important technical means of engineering geological survey. Compared with the traditional 2D geological data representation method, 3D geological model can intuitively reproduce the spatial distribution of geological units and their mutual relationships, and has unique advantages in geological data interpretation and 3D data visualization, but the problems exposed in the modeling process also come along.

[0003] In engineering geology, researchers often use spatial interpolation methods to construct geological models. However, when the lithology values ​​are discontinuous or the lithology boundary attribute values ​​change, there will be obvious jagged or step phenomena, and the position of the rock layer boundary point is generally not allowed to change. The existing anti-aliasing algorithms (such as contour method, trilinear interpolation method, etc.) are difficult to meet the requirements of rationality and consistency of rock layer superposition.

[0004] Therefore, we propose a raster geological model boundary anti-aliasing method and system. Summary of the invention

[0005] The technical task of the present invention is to address the above shortcomings and provide a method and system for anti-aliasing the boundaries of a grid geological model. The method generates two layers of Delaunay triangulation models with the same longitude and latitude but different elevations according to the range of the geological structure model; the model results are effectively applied to realize a series of analysis applications such as excavation analysis, stripping analysis, and fence profiles to solve the above problems.

[0006] To achieve the above object, the present invention provides the following technical solutions:

[0007] A method for anti-aliasing the boundary of a raster geological model comprises the following steps:

[0008] S1: Generate two layers of Delaunay triangulation models with the same longitude and latitude but different elevations according to the range of the geological structure model;

[0009] Among them, the upper triangulated network and the lower triangulated network form a stratum, each triangulated network is composed of multiple triangular facets, and each triangular facet is composed of three vertices;

[0010] S2: obtain the triangular facets that need to be anti-aliased, the triangular facets that constitute the upper layer Delaunay triangulation are the upper layer triangular facets, and the triangular facets that constitute the lower layer Delaunay triangulation are the lower layer triangular facets;

[0011] S3: Anti-aliasing of boundary triangles;

[0012] S4: Anti-aliasing of internal triangles;

[0013] S5: Model visualization;

[0014] S6: Geological analysis applications;

[0015] In S3, when the three vertices of a triangle are a valid point Q(x Q ,y Q ), two invalid points O(x O ,y O )、P(x P ,y P ), and the valid points are on the boundary, and the invalid points are not on the boundary;

[0016] ① Insert m encryption points M1, M2, ..., M between two invalid points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows:

[0017]

[0018]

[0019] ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting the valid points and invalid points and the lines connecting the valid points and encrypted points. n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows:

[0020]

[0021]

[0022] Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P;

[0023] Among them, the effective point Q(x Q ,y Q ) and the invalid point O(x O ,y O )The calculation formula of the cutting point coordinates N(x1,y1) of the connecting line is as follows:

[0024] x1=x O +0.3(x Q -x O );

[0025] y1=y O +0.3(y Q -y O );

[0026] Among them, the effective point Q(x Q ,y Q ) and the invalid point P(x P ,y P )The cutting point coordinates of the connecting line are N(x n ,y n ) is calculated as follows:

[0027] x n =x P +0.3(x Q -x P );

[0028] y n =y P +0.3(y Q -y P );

[0029] Among them, the effective point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0030]

[0031] j=i+1;

[0032]

[0033]

[0034] Among them, S QM is the length between point Q and point M;

[0035] ③Use the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) replaces the original triangular patch, and the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) is an anti-aliased face;

[0036] In S3, when the three vertices of a triangle are a valid point Q(x Q ,y Q), two invalid points O(x O ,y O )、P(x P ,y P ), and an effective point Q(x Q ,y Q ) and one of the invalid points P(x P ,y P ) is on the boundary, and another invalid point O(x O ,y O ) is not on the border;

[0037] ①According to the invalid point O(x O ,y O ) and the effective point Q(x Q ,y Q ) coordinates, calculate the cutting point N(x j ,y j ) coordinates, the calculation formula is as follows:

[0038] x j =0.7x O +0.3x Q ;

[0039] y j =0.7y O +0.3y Q ;

[0040] ②Use the effective point Q(x Q ,y Q ), invalid point P(x P ,y P ) and the cutting point N(x j ,y j ) replaces the original triangular patch, and the effective point Q(x Q ,y Q ), invalid point P(x P ,y P ) and the cutting point N(x j ,y j ) is an anti-aliased face;

[0041] In S3, when the three vertices of a triangle are two valid points O(x O ,y O )、P(x P ,y P ), and an invalid point Q(x Q ,y Q ), when two valid points are on the boundary and the invalid point is not on the boundary, or when one valid point is on the boundary and the other two points are not on the boundary;

[0042] ① Insert m encryption points M1, M2, ..., M between two valid points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows:

[0043]

[0044]

[0045] ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting invalid points and valid points and the lines connecting invalid points and encrypted points. n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows:

[0046]

[0047]

[0048] Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P;

[0049] Among them, the invalid point Q(x Q ,y Q ) and the effective point O(x O ,y O ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0050] x1=x Q +0.3(x O -x Q );

[0051] y1=y Q +0.3(y O -y Q );

[0052] Among them, the invalid point Q(x Q ,y Q ) and the effective point P(x P ,y P ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0053] x n =x Q +0.3(x P -x Q );

[0054] y n =yQ +0.3(y P -y Q );

[0055] Among them, the invalid point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0056]

[0057] j=i+1;

[0058]

[0059]

[0060] Among them, S QM is the length between point Q and point M;

[0061] ③ The triangular patch composed of effective points, encrypted points and cutting points is used to replace the original triangular patch. The triangular patch composed of effective points, encrypted points and cutting points is the patch after anti-aliasing processing;

[0062] In S3, when the three vertices of a triangle are two valid points O(x O ,y O )、P(x P ,y P ), an invalid point Q(x Q ,y Q ), when any valid point and invalid point are on the boundary and the other valid point is not on the boundary, such triangles are not processed and the entire triangle is retained;

[0063] When all the vertices on the boundary of a triangle are invalid points, such triangles are not processed and the entire triangle is retained;

[0064] When the three vertices of a triangle are on the boundary, this type of triangle is not processed and the entire triangle is retained.

[0065] Preferably, in S4, when the three vertices of the triangle are an internal boundary point Q(x Q ,y Q ), two effective points O(x O ,y O )、P(x P ,y P )hour;

[0066] ① Insert m encryption points M1, M2, ..., M between two valid pointsm , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows:

[0067]

[0068]

[0069] ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting the internal boundary points and the effective points and the lines connecting the internal boundary points and the encrypted points. n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows:

[0070]

[0071]

[0072] Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P;

[0073] Among them, the internal boundary point Q(x Q ,y Q ) and the effective point O(x O ,y O ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0074] x1=x Q +0.3(x O -x Q );

[0075] y1=y Q +0.3(y O -y Q );

[0076] Among them, the internal boundary point Q(x Q ,y Q ) and the effective point P(x P ,y P ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0077] x n =x Q +0.3(x P -x Q );

[0078] y n =y Q +0.3(y P -yQ );

[0079] Among them, the internal boundary point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0080]

[0081] j=i+1;

[0082]

[0083]

[0084] Among them, S QM is the length between point Q and point M;

[0085] ③ The triangular patch composed of effective points, encrypted points and cutting points is used to replace the original triangular patch. The triangular patch composed of effective points, encrypted points and cutting points is the anti-aliased patch.

[0086] Preferably, in S4, when one of the three vertices of the triangle is an internal boundary point Q(x Q ,y Q ), one is a valid point O(x O ,y O ), one is an invalid point P(x P ,y P )hour;

[0087] ① Insert m encryption points M1, M2, ..., M between the valid points and the invalid points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows:

[0088]

[0089]

[0090] ② Generate n cutting points N1, N2, ..., N with smoothing effect on the connection line of internal boundary points, valid points, invalid points and encrypted points n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows:

[0091]

[0092]

[0093] Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P;

[0094] Among them, the internal boundary point Q(x Q ,y Q ) and the effective point O(x O ,y O ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0095] x1=x Q +0.3(x O -x Q );

[0096] y1=y Q +0.3(y O -y Q );

[0097] Among them, the internal boundary point Q(x Q ,y Q ) and the invalid point P(x P ,y P ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0098] x n =x Q +0.3(x P -x Q );

[0099] y n =y Q +0.3(y P -y Q );

[0100] Among them, the internal boundary point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0101]

[0102] j=i+1;

[0103]

[0104]

[0105] Among them, S QM is the length between point Q and point M;

[0106] ③ The triangular patch composed of effective points, encrypted points and cutting points is used to replace the original triangular patch. The triangular patch composed of effective points, encrypted points and cutting points is the anti-aliased patch.

[0107] Preferably, in S4, when the three vertices of the triangle are two internal boundary points O(x O ,y O ) and P(x P ,y P ), one is the effective point Q(x Q ,y Q )hour;

[0108] ① Insert m encryption points M1, M2, ..., M between two internal boundary points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows:

[0109]

[0110]

[0111] ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting the effective points and the internal boundary points and the lines connecting the effective points and the encrypted points. n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows:

[0112]

[0113]

[0114] Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P;

[0115] Among them, the effective point Q(x Q ,y Q ) and internal boundary points O(x O ,y O ) The coordinate calculation formula of the cutting point N(x1,y1) of the connecting line is as follows:

[0116] x1=x O +0.3(x Q -x O );

[0117] y1=y O +0.3(y Q -y O );

[0118] Among them, the effective point Q(x Q ,y Q ) and the internal boundary point P(x P ,y P )The cutting point N(x n ,y n ) The coordinate calculation formula is as follows:

[0119] x n =x P +0.3(x Q -x P );

[0120] y n =y O +0.3(y Q -y O );

[0121] Among them, the effective point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0122]

[0123] j=i+1;

[0124]

[0125]

[0126] Among them, S QM is the length between point Q and point M;

[0127] ③Use the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) replaces the original triangular patch, and the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) is the anti-aliased face.

[0128] Preferably, in S4, when the three vertices of a triangle face do not have internal boundary points, such triangle face is not processed and the entire triangle face is retained.

[0129] The present invention also provides a grid geological model boundary anti-aliasing system, comprising:

[0130] A triangulated network generation module, which is used to generate a Delaunay triangulated network model;

[0131] An anti-aliased face acquisition module is used to acquire triangular facets that need to be anti-aliased;

[0132] An anti-aliasing processing module, which is used to perform anti-aliasing processing on the obtained triangular facets;

[0133] A visualization module, which is used to visualize the processing results;

[0134] The analysis application module is used to perform geological model analysis and realize a series of geological analysis functions such as excavation analysis, stripping analysis, and fence profile.

[0135] Compared with the prior art, the advantages and positive effects of the present invention are:

[0136] 1. The present invention generates two layers of Delaunay triangulation models with the same longitude and latitude but different elevations according to the range of the geological structure model; obtains triangular facets that need to be anti-aliased, and uses a boundary anti-aliasing algorithm to smooth the obtained triangular facets, thereby improving the jagged or step problems of the rock layer interface, improving the smoothing effect of the boundary of the three-dimensional geological model, and the algorithm processing results meet the requirements of horizontal continuity of the rock layer and the rationality and consistency of superposition;

[0137] 2. The present invention realizes efficient visualization of the results by programming the algorithm formula and adopting the open source WebGL technology;

[0138] 3. The present invention effectively applies the results of the constructed three-dimensional geological model to realize a series of analysis applications such as excavation analysis, stripping analysis and fence profile, and realizes a variety of geological analysis functions. BRIEF DESCRIPTION OF THE DRAWINGS

[0139] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0140] Figure 1 This is a flow chart of the anti-aliasing method for the grid geological model boundary in Example 1 of the present invention;

[0141] Figure 2 The internal boundary point verification diagram in Example 1 of the present invention;

[0142] Figure 3 This is a flow chart of model visualization rendering in Embodiment 1 of the present invention;

[0143] Figure 4 The anti-aliasing effect of the triangular face in Example 1 of the present invention Figure 1 ;

[0144] Figure 5 The anti-aliasing effect of the triangular face in Example 1 of the present invention Figure 2 ;

[0145] Figure 6 The anti-aliasing effect of the triangular face in Example 1 of the present invention Figure 3 ;

[0146] Figure 7 The anti-aliasing effect of the triangular face in Example 1 of the present invention Figure 4 ;

[0147] Figure 8 The anti-aliasing effect of the triangular face in Example 1 of the present invention Figure 5 ;

[0148] Fig. 9 The anti-aliasing effect of the triangular face in Example 1 of the present invention Figure 6 ;

[0149] Fig.10 The anti-aliasing effect of the triangular face in Example 1 of the present invention Figure 7 ;

[0150] Fig.11 The anti-aliasing effect of the triangular face in Example 1 of the present invention Figure 8 ;

[0151] Fig.12 The anti-aliasing effect of the triangular face in Example 1 of the present invention Figure 9 ;

[0152] Fig.13 The anti-aliasing effect of the triangular face in Example 1 of the present invention Figure 10 ;

[0153] Fig.14 The anti-aliasing effect of the triangular face in Example 1 of the present invention Figure 10 one;

[0154] Fig.15 This is a grid display diagram of the geological model in Example 2 of the present invention without anti-aliasing processing;

[0155] Fig.16 The mesh not displayed is a diagram of the geological model in Example 2 of the present invention that has not been anti-aliased;

[0156] Fig.17A grid display diagram showing anti-aliasing of the geological model in Example 2 of the present invention;

[0157] Fig.18 The grid that is anti-aliased for the geological model in Embodiment 2 of the present invention is not displayed;

[0158] Fig.19 This is an excavation analysis diagram in Example 2 of the present invention;

[0159] Fig. 20 This is a peeling analysis diagram in Example 2 of the present invention;

[0160] Fig.21 This is a cross-sectional view of the fence in Example 2 of the present invention. DETAILED DESCRIPTION

[0161] In order to more clearly understand the above-mentioned purpose, features and advantages of the present invention, the present invention is further described below in conjunction with the accompanying drawings and embodiments. It should be noted that the embodiments of the present application and the features in the embodiments can be combined with each other without conflict.

[0162] The present invention will be further described below in conjunction with the accompanying drawings and specific embodiments.

[0163] Example 1

[0164] like Figure 1 As shown, according to a first aspect of the present invention, the present invention provides a method for anti-aliasing the boundary of a raster geological model, comprising the following steps:

[0165] S1: Generate a Delaunay triangulated network model with the same latitude and longitude but different elevations according to the range of the geological structure model;

[0166] Among them, the upper triangulated network and the lower triangulated network form a stratum, each triangulated network is composed of multiple triangular facets, and each triangular facet is composed of three vertices;

[0167] S2: obtain the triangular facets that need to be anti-aliased, the triangular facets that constitute the upper layer Delaunay triangulation are the upper layer triangular facets, and the triangular facets that constitute the lower layer Delaunay triangulation are the lower layer triangular facets;

[0168] It is assumed that the difference between the vertex elevation of the upper triangle patch and the vertex elevation of the corresponding lower triangle patch is ΔH. If ΔH≥H, H is a non-negative constant, the vertex is considered to be a valid point, otherwise it is an invalid point.

[0169] ① If the three vertices of the upper triangle are all invalid points, the stratum composed of the upper triangle and the lower triangle is considered invalid;

[0170] ② If the three vertices of the upper triangle are all valid points, the stratum composed of the upper triangle and the lower triangle is considered valid, but no anti-aliasing is performed;

[0171] ③ In other cases, the stratum composed of the upper triangular facets and the lower triangular facets is considered to be a valid stratum that needs to be anti-aliased;

[0172] S3: Anti-aliasing of boundary triangles;

[0173] S4: Anti-aliasing of internal triangles. Since the upper triangles and the lower triangles have the same longitude and latitude, but different elevations, the shapes of the upper triangles and the lower triangles need to be kept consistent during the anti-aliasing process. Therefore, only the upper triangles are anti-aliased. If the three vertices of the internal triangle contain invalid points, each invalid point that makes up the triangle needs to be verified. Verify the validity of the eight surrounding vertices with the invalid point as the center. If the vertex validity satisfies the following conditions: Figure 2 If any of the six types shown is true, the vertex is called an internal boundary point;

[0174] S5: Model visualization, combined with open source WebGL technology, completes efficient visualization of the model. WebGL visualization technology has the advantages of no plug-in, hardware acceleration, and good browser compatibility. Its rendering process is as follows Figure 3 As shown;

[0175] S6: Geological analysis application, based on the constructed 3D geological model, realize model analysis and application, including excavation analysis, stripping analysis and fence profile;

[0176] Among them, excavation analysis can perform excavation modeling on geological bodies by setting model range and depth parameters; stripping analysis supports layered display of geological bodies, thereby realizing the display of key or interesting strata and intuitively reflecting the stratum conditions; fence profiles automatically generate fence profile models by drawing multiple section lines on the generated geological body model.

[0177] like Figure 4 As shown, in S3, when the three vertices of the triangle are a valid point Q(x Q ,y Q ), two invalid points O(x O ,y O )、P(x P ,y P ), and the valid points are on the boundary, and the invalid points are not on the boundary;

[0178] ① Insert m encryption points M1, M2, ..., M between two invalid points m , encryption point M(x i ,yi ), i∈[1,m], the calculation formula is as follows:

[0179]

[0180]

[0181] ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting the valid points and invalid points and the lines connecting the valid points and encrypted points. n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows:

[0182]

[0183]

[0184] Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P;

[0185] Among them, the effective point Q(x Q ,y Q ) and the invalid point O(x O ,y O )The calculation formula of the cutting point coordinates N(x1,y1) of the connecting line is as follows:

[0186] x1=x O +0.3(x Q -x O );

[0187] y1=y O +0.3(y Q -y O );

[0188] Among them, the effective point Q(x Q ,y Q ) and the invalid point P(x P ,y P )The cutting point coordinates of the connecting line are N(x n ,y n ) is calculated as follows:

[0189] x n =x P +0.3(x Q -x P );

[0190] y n =y P +0.3(y Q -yP );

[0191] Among them, the effective point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0192]

[0193] j=i+1;

[0194]

[0195]

[0196] Among them, S QM is the length between point Q and point M;

[0197] ③Use the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) replaces the original triangular patch, and the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) is the anti-aliased face.

[0198] like Figure 5 As shown, in S3, when the three vertices of the triangle are a valid point Q(x Q ,y Q ), two invalid points O(x O ,y O )、P(x P ,y P ), and an effective point Q(x Q ,y Q ) and one of the invalid points P(x P ,y P ) is on the boundary, and another invalid point O(x O ,y O ) is not on the border;

[0199] ①According to the invalid point O(x O ,y O ) and the effective point Q(x Q ,y Q ) coordinates, calculate the cutting point N(x j ,y j ) coordinates, the calculation formula is as follows:

[0200] x j =0.7x O +0.3x Q ;

[0201] y j =0.7y O +0.3y Q ;

[0202] ②Use the effective point Q(x Q ,y Q ), invalid point P(x P ,y P ) and the cutting point N(x j ,y j ) replaces the original triangular patch, and the effective point Q(x Q ,y Q ), invalid point P(x P ,y P ) and the cutting point N(x j ,y j ) is the anti-aliased face.

[0203] like Figure 6 and Figure 7 As shown, in S3, when the three vertices of the triangle are two valid points O(x O ,y O )、P(x P ,y P ), and an invalid point Q(x Q ,y Q ), when two valid points are on the boundary and the invalid point is not on the boundary, or when one valid point is on the boundary and the other two points are not on the boundary;

[0204] ① Insert m encryption points M1, M2, ..., M between two valid points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows:

[0205]

[0206]

[0207] ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting invalid points and valid points and the lines connecting invalid points and encrypted points. n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows:

[0208]

[0209]

[0210] Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P;

[0211] Among them, the invalid point Q(x Q ,y Q ) and the effective point O(x O ,y O ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0212] x1=x Q +0.3(x O -x Q );

[0213] y1=y Q +0.3(y O -y Q );

[0214] Among them, the invalid point Q(x Q ,y Q ) and the effective point P(x P ,y P ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0215] x n =x Q +0.3(x P -x Q );

[0216] y n =y Q +0.3(y P -y Q );

[0217] Among them, the invalid point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0218]

[0219] j=i+1;

[0220]

[0221]

[0222] Among them, S QM is the length between point Q and point M;

[0223] ③ The triangular patch composed of effective points, encrypted points and cutting points is used to replace the original triangular patch. The triangular patch composed of effective points, encrypted points and cutting points is the anti-aliased patch.

[0224] like Figure 8 As shown, in S3, when the three vertices of the triangle are two valid points O(x O ,y O )、P(x P ,y P ), an invalid point Q(x Q ,y Q ), when any valid point and invalid point are on the boundary and the other valid point is not on the boundary, such triangles are not processed and the entire triangle is retained;

[0225] like Fig. 9 As shown, in S3, when the vertices on the boundary of the vertices constituting the triangle are all invalid points, such triangles are not processed and the entire triangle is retained;

[0226] When the three vertices of a triangle are on the boundary, this type of triangle is not processed and the entire triangle is retained.

[0227] like Fig.10 As shown, in S4, when the three vertices of the triangle are an internal boundary point Q(x Q ,y Q ), two effective points O(x O ,y O )、P(x P ,y P )hour;

[0228] ① Insert m encryption points M1, M2, ..., M between two valid points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows:

[0229]

[0230]

[0231] ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting the internal boundary points and the effective points and the lines connecting the internal boundary points and the encrypted points. n , cutting point N(x j ,y j), j∈[1,n], the calculation formula is as follows:

[0232]

[0233]

[0234] Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P;

[0235] Among them, the internal boundary point Q(x Q ,y Q ) and the effective point O(x O ,y O ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0236] x1=x Q +0.3(x O -x Q );

[0237] y1=y Q +0.3(y O -y Q );

[0238] Among them, the internal boundary point Q(x Q ,y Q ) and the effective point P(x P ,y P ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0239] x n =x Q +0.3(x P -x Q );

[0240] y n =y Q +0.3(y P -y Q );

[0241] Among them, the internal boundary point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0242]

[0243] j=i+1;

[0244]

[0245]

[0246] Among them, S QM is the length between point Q and point M;

[0247] ③ The triangular patch composed of effective points, encrypted points and cutting points is used to replace the original triangular patch. The triangular patch composed of effective points, encrypted points and cutting points is the anti-aliased patch.

[0248] like Fig.11 As shown, in S4, when one of the three vertices of the triangle is an internal boundary point Q(x Q ,y Q ), one is a valid point O(x O ,y O ), one is an invalid point P(x P ,y P )hour;

[0249] ① Insert m encryption points M1, M2, ..., M between the valid points and the invalid points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows:

[0250]

[0251]

[0252] ② Generate n cutting points N1, N2, ..., N with smoothing effect on the connection line of internal boundary points, valid points, invalid points and encrypted points n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows:

[0253]

[0254]

[0255] Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P;

[0256] Among them, the internal boundary point Q(x Q ,y Q ) and the effective point O(x O ,y O ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0257] x1=x Q +0.3(x O-x Q );

[0258] y1=y Q +0.3(y O -y Q );

[0259] Among them, the internal boundary point Q(x Q ,y Q ) and the invalid point P(x P ,y P ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0260] x n =x Q +0.3(x P -x Q );

[0261] y n =y Q +0.3(y P -y Q );

[0262] Among them, the internal boundary point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0263]

[0264] j=i+1;

[0265]

[0266]

[0267] Among them, S QM is the length between point Q and point M;

[0268] ③ The triangular patch composed of effective points, encrypted points and cutting points is used to replace the original triangular patch. The triangular patch composed of effective points, encrypted points and cutting points is the anti-aliased patch.

[0269] like Fig.12 As shown, in S4, when the three vertices of the triangle are two internal boundary points O(x O ,y O ) and P(x P ,y P ), one is the effective point Q(x Q ,y Q )hour;

[0270] ① Insert m encryption points M1, M2, ..., M between two internal boundary points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows:

[0271]

[0272]

[0273] ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting the effective points and the internal boundary points and the lines connecting the effective points and the encrypted points. n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows:

[0274]

[0275]

[0276] Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P;

[0277] Among them, the effective point Q(x Q ,y Q ) and internal boundary points O(x O ,y O ) The coordinate calculation formula of the cutting point N(x1,y1) of the connecting line is as follows:

[0278] x1=x O +0.3(x Q -x O );

[0279] y1=y O +0.3(y Q -y O );

[0280] Among them, the effective point Q(x Q ,y Q ) and the internal boundary point P(x P ,y P )The cutting point N(x n ,y n ) The coordinate calculation formula is as follows:

[0281] x n =x P +0.3(x Q -x P );

[0282] y n =y O +0.3(y Q -y O );

[0283] Among them, the effective point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows:

[0284]

[0285] j=i+1;

[0286]

[0287]

[0288] Among them, S QM is the length between point Q and point M;

[0289] ③Use the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) replaces the original triangular patch, and the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) is the anti-aliased face.

[0290] like Fig.13 and Fig.14 As shown, in S4, when the three vertices of a triangle do not have internal boundary points, such triangle is not processed and the entire triangle is retained.

[0291] Note: The symbol ○ in all figures represents invalid points, ● represents valid points, ◎ represents internal boundary points, and △ represents any type of vertex.

[0292] The parameter "y" in the above embodiment o ”, “y p ”, “y Q " represents the distance between points or the y-axis component of the position coordinates. The specific meanings are as follows:

[0293] y o :

[0294] It usually represents the distance or coordinate difference between a point (such as point O) and another point (such as point Q) in the y-axis direction. In the anti-aliasing algorithm, this distance or difference is used to calculate the position of the encryption point or cutting point.

[0295] For example, in the calculation formula of the cutting point, "y o " can represent the distance or position difference between the cutting point and one of the two points it connects (such as between Q and O) on the y-axis.

[0296] y p :

[0297] Similarly, this parameter also represents the distance or coordinate difference between two points (such as point P and point Q) in the y-axis direction.

[0298] In the anti-aliasing calculation process, "y p " is used to help determine the location of cut points, especially when you need to generate smooth cut points along a line segment.

[0299] y Q :

[0300] "y Q ” usually refers to the coordinate value of point Q on the y-axis, rather than directly indicating the distance. However, in the calculation process, it can be used to compare the y coordinates of other points (such as “y o " or "y p ”) to determine relative positions or generate new points.

[0301] It should be noted that in the calculation formula that directly gives the coordinates of the cutting point or the encryption point, "y Q " itself may not be directly involved in the calculation, but its coordinate value is related to the coordinate value of other points (such as "y o " or "y p ”) to calculate the y coordinate of a new point (such as a cutting point or an encryption point).

[0302] In the anti-aliasing algorithm, these parameters are used to determine how to insert encryption points and cutting points in boundary or non-boundary triangular patches to achieve the effect of smoothing the boundary and internal areas. By calculating the distance or coordinate difference between these points, the algorithm can accurately locate the position of the new point, thereby replacing the original jagged boundary or internal patch, improving the smoothness and visual effect of the 3D geological model.

[0303] Example 2

[0304] According to a second aspect of the present invention, the present invention provides a grid body geological model boundary anti-aliasing system, comprising:

[0305] A triangulated network generation module, which is used to generate a Delaunay triangulated network model;

[0306] An anti-aliased face acquisition module is used to acquire triangular facets that need to be anti-aliased;

[0307] An anti-aliasing processing module, which is used to perform anti-aliasing processing on the obtained triangular facets;

[0308] The visualization module is used to visualize the processing results. The model results are as follows: Figure 15 to Figure 18 As shown;

[0309] The analysis application module is used to perform geological model analysis, realize a series of geological analysis functions such as excavation analysis, stripping analysis, fence profile, etc. The analysis results are as follows: Figure 19 to Figure 21 shown.

[0310] In summary, the present invention generates an upper and lower Delaunay triangulation model with the same longitude and latitude but different elevations according to the range of the geological structure model; obtains triangular facets that need to be anti-aliased, and uses a boundary anti-aliasing algorithm to smooth the obtained triangular facets; programs the algorithm formula and combines it with WebGL visualization technology to achieve efficient display of the results; and effectively applies the model results to realize a series of analysis applications such as excavation analysis, stripping analysis, and fence profiles.

[0311] Through the above specific implementations, those skilled in the art can easily implement the present invention. However, it should be understood that the present invention is not limited to the above specific implementations. On the basis of the disclosed implementations, those skilled in the art can arbitrarily combine different technical features to achieve different technical solutions.

Claims

1. A method for anti-aliasing the boundary of a raster geological model, characterized in that: The following steps are involved: S1: Generate two layers of Delaunay triangulation models with the same longitude and latitude but different elevations according to the range of the geological structure model; Among them, the upper triangulated network and the lower triangulated network form a stratum, each triangulated network is composed of multiple triangular facets, and each triangular facet is composed of three vertices; S2: obtain the triangular facets that need to be anti-aliased, the triangular facets that constitute the upper layer Delaunay triangulation are the upper layer triangular facets, and the triangular facets that constitute the lower layer Delaunay triangulation are the lower layer triangular facets; S3: Anti-aliasing of boundary triangles; S4: Anti-aliasing of internal triangles; S5: Model visualization; S6: Geological analysis applications; In S3, when the three vertices of a triangle are a valid point Q(x Q ,y Q ), two invalid points O(x O ,y O )、P(x P ,y P ), and the valid points are on the boundary, and the invalid points are not on the boundary; ① Insert m encryption points M1, M2, ..., M between two invalid points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows: ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting the valid points and invalid points and the lines connecting the valid points and encrypted points. n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows: Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P; Among them, the effective point Q(x Q ,y Q ) and the invalid point O(x O ,y O )The calculation formula of the cutting point coordinates N(x1,y1) of the connecting line is as follows: x1=x O +0.3(x Q -x O ); y1=y O +0.3(y Q -y O ); Among them, the effective point Q(x Q ,y Q ) and the invalid point P(x P ,y P )The cutting point coordinates of the connecting line are N(x n ,y n ) is calculated as follows: x n =x P +0.3(x Q -x P ); and n =and P +0.3(and Q -and P ); Among them, the effective point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows: j=i+1; Among them, S QM is the length between point Q and point M; ③Use the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) replaces the original triangular patch, and the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) is an anti-aliased face; In S3, when the three vertices of a triangle are a valid point Q(x Q ,y Q ), two invalid points O(x O ,y O )、P(x P ,y P ), and an effective point Q(x Q ,y Q ) and one of the invalid points P(x P ,y P ) is on the boundary, and another invalid point O(x O ,y O ) is not on the border; ①According to the invalid point O(x O ,y O ) and the effective point Q(x Q ,y Q ) coordinates, calculate the cutting point N(x j ,y j ) coordinates, the calculation formula is as follows: x j =0.7x O +0.3x Q ; <h2 style=";text-align:left;direction:ltr">y<h2 style=";text-align:left;direction:ltr"> j <h2 style=";text-align:left;direction:ltr"> <0.7y<h2 style=";text-align:left;direction:ltr"> O <h2 style=";text-align:left;direction:ltr"> +0.3y<h2 style=";text-align:left;direction:ltr"> Q <h2 style=";text-align:left;direction:ltr"> ; ②Use the effective point Q(x Q ,y Q ), invalid point P(x P ,y P ) and the cutting point N(x j ,y j ) replaces the original triangular patch, and the effective point Q(x Q ,y Q ), invalid point P(x P ,y P ) and the cutting point N(x j ,y j ) is an anti-aliased face; In S3, when the three vertices of a triangle are two valid points O(x O ,y O )、P(x P ,y P ), and an invalid point Q(x Q ,y Q ), when two valid points are on the boundary and the invalid point is not on the boundary, or when one valid point is on the boundary and the other two points are not on the boundary; ① Insert m encryption points M1, M2, ..., M between two valid points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows: ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting invalid points and valid points and the lines connecting invalid points and encrypted points. n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows: Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P; Among them, the invalid point Q(x Q ,y Q ) and the effective point O(x O ,y O ) The calculation formula of the cutting point coordinates of the connecting line is as follows: x1=x Q +0.3(x O -x Q ); y1=y Q +0.3(y O -y Q ); Among them, the invalid point Q(x Q ,y Q ) and the effective point P(x P ,y P ) The calculation formula of the cutting point coordinates of the connecting line is as follows: x n =x Q +0.3(x P -x Q ); and n =and Q +0.3(and P -and Q ); Among them, the invalid point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows: j=i+1; Among them, S QM is the length between point Q and point M; ③ The triangular patch composed of effective points, encrypted points and cutting points is used to replace the original triangular patch. The triangular patch composed of effective points, encrypted points and cutting points is the patch after anti-aliasing processing; In S3, when the three vertices of a triangle are two valid points O(x O ,y O )、P(x P ,y P ), an invalid point Q(x Q ,y Q ), when any valid point and invalid point are on the boundary and the other valid point is not on the boundary, such triangles are not processed and the entire triangle is retained; When all the vertices on the boundary of a triangle are invalid points, such triangles are not processed and the entire triangle is retained; When the three vertices of a triangle are on the boundary, this type of triangle is not processed and the entire triangle is retained.

2. The method for anti-aliasing the boundary of a grid geological model according to claim 1, characterized in that: In S4, when the three vertices of a triangle are an internal boundary point Q(x Q ,y Q ), two effective points O(x O ,y O )、P(x P ,y P )hour; ① Insert m encryption points M1, M2, ..., M between two valid points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows: ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting the internal boundary points and the effective points and the lines connecting the internal boundary points and the encrypted points. n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows: Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P; Among them, the internal boundary point Q(x Q ,y Q ) and the effective point O(x O ,y O ) The calculation formula of the cutting point coordinates of the connecting line is as follows: x1=x Q +0.3(x O -x Q ); y1=y Q +0.3(y O -y Q ); Among them, the internal boundary point Q(x Q ,y Q ) and the effective point P(x P ,y P ) The calculation formula of the cutting point coordinates of the connecting line is as follows: x n =x Q +0.3(x P -x Q ); and n =and Q +0.3(and P -and Q ); Among them, the internal boundary point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows: j=i+1; Among them, S QM is the length between point Q and point M; ③ The triangular patch composed of effective points, encrypted points and cutting points is used to replace the original triangular patch. The triangular patch composed of effective points, encrypted points and cutting points is the anti-aliased patch.

3. The method for anti-aliasing the boundary of a grid geological model according to claim 2, characterized in that: In S4, when one of the three vertices of a triangle is an internal boundary point Q(x Q ,y Q ), one is a valid point O(x O ,y O ), one is an invalid point P(x P ,y P )hour; ① Insert m encryption points M1, M2, ..., M between the valid points and the invalid points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows: ② Generate n cutting points N1, N2, ..., N with smoothing effect on the connection line of internal boundary points, valid points, invalid points and encrypted points n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows: Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P; Among them, the internal boundary point Q(x Q ,y Q ) and the effective point O(x O ,y O ) The calculation formula of the cutting point coordinates of the connecting line is as follows: x1=x Q +0.3(x O -x Q ); y1=y Q +0.3(y O -y Q ); Among them, the internal boundary point Q(x Q ,y Q ) and the invalid point P(x P ,y P ) The calculation formula of the cutting point coordinates of the connecting line is as follows: x n =x Q +0.3(x P -x Q ); and n =and Q +0.3(and P -and Q ); Among them, the internal boundary point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows: j=i+1; Among them, S QM is the length between point Q and point M; ③ The triangular patch composed of effective points, encrypted points and cutting points is used to replace the original triangular patch. The triangular patch composed of effective points, encrypted points and cutting points is the anti-aliased patch.

4. The method for anti-aliasing the boundary of a grid geological model according to claim 3, characterized in that: In S4, when the three vertices of the triangle are two internal boundary points O(x O ,y O ) and P(x P ,y P ), one is the effective point Q(x Q ,y Q )hour; ① Insert m encryption points M1, M2, ..., M between two internal boundary points m , encryption point M(x i ,y i ), i∈[1,m], the calculation formula is as follows: ② Generate n cutting points N1, N2, ..., N with smoothing effect on the lines connecting the effective points and the internal boundary points and the lines connecting the effective points and the encrypted points. n , cutting point N(x j ,y j ), j∈[1,n], the calculation formula is as follows: Among them, S QO is the length between point Q and point O; S QP is the length between point Q and point P; Among them, the effective point Q(x Q ,y Q ) and internal boundary points O(x O ,y O ) The coordinate calculation formula of the cutting point N(x1,y1) of the connecting line is as follows: x1=x O +0.3(x Q -x O ); y1=y O +0.3(y Q -y O ); Among them, the effective point Q(x Q ,y Q ) and the internal boundary point P(x P ,y P )The cutting point N(x n ,y n ) The coordinate calculation formula is as follows: x n =x P +0.3(x Q -x P ); and n =and O +0.3(and Q -and O ); Among them, the effective point Q(x Q ,y Q ) and the encryption point M(x i ,y i ) The calculation formula of the cutting point coordinates of the connecting line is as follows: j=i+1; Among them, S QM is the length between point Q and point M; ③Use the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) replaces the original triangular patch, and the effective point Q(x Q ,y Q ) and the cutting point N(x j ,y j ) is the anti-aliased face.

5. The method for anti-aliasing the boundary of a grid geological model according to claim 4, characterized in that: In S4, when the three vertices of a triangle do not have internal boundary points, such triangles are not processed and the entire triangle is retained.

6. A grid geological model boundary anti-aliasing system, characterized in that: The method for anti-aliasing the boundary of a grid geological model in claim 5 is used to perform the operation, comprising: A triangulated network generation module, which is used to generate a Delaunay triangulated network model; An anti-aliased face acquisition module is used to acquire triangular facets that need to be anti-aliased; An anti-aliasing processing module, which is used to perform anti-aliasing processing on the obtained triangular facets; A visualization module, which is used to visualize the processing results; The analysis application module is used to perform geological model analysis and realize the geological analysis functions of excavation analysis, stripping analysis, and fence profile.

Images