CN110223390A - A kind of multi-section-line insertion TIN algorithm based on straight line voxel traversal principle - Google Patents
A kind of multi-section-line insertion TIN algorithm based on straight line voxel traversal principle Download PDFInfo
- Publication number
- CN110223390A CN110223390A CN201910507116.7A CN201910507116A CN110223390A CN 110223390 A CN110223390 A CN 110223390A CN 201910507116 A CN201910507116 A CN 201910507116A CN 110223390 A CN110223390 A CN 110223390A
- Authority
- CN
- China
- Prior art keywords
- section
- tin
- line
- cell
- vertex
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/05—Geographic models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
Abstract
The invention discloses a kind of, and the multi-section-line based on straight line voxel traversal principle is embedded in TIN algorithm, step are as follows: establish multi-section-line and TIN spatial index；Multi-section-line is embedded in TIN.The present invention realizes a kind of multi-section-line insertion TIN algorithm based on straight line voxel traversal, the algorithm is when constructing multi-section-line and TIN spatial index, applicable line voxel traversal principle, the be in line side of section and TIN intermediate cam shape of multi-section-line each group is set only to be associated with its practical indexing units lattice passed through, so that the time caused by detection meaningless during reducing multi-section-line insertion TIN calculates wastes, the time efficiency of the operations such as subsequent cutting, segmentation is greatly improved, there is certain reference and application value to other related fieldss based on TIN structure mould.
Description
Technical field
The invention belongs to the technical field of digital mine more particularly to a kind of multi-section-lines based on straight line voxel traversal principle
It is embedded in TIN algorithm.
Background technique
Irregular triangle network (Triangulated Irregular Network, TIN) is according to certain ad hoc rules
(such as: Delaunay Triangulation rule) carries out triangulation to structure module object discretization of half-space surface sampled point, to construct a kind of company
Irregular triangle network that is continuous, not overlapping spatially describes the space geometry form on structure module object surface.TIN is preferably protected
The primitiveness of measurement data has been held, the needs of high-precision modeling can either be met, while being also avoided that modeled object surface part
Data redundancy when rising and falling flat, therefore, TIN be widely used in digital terrain model (Digital Terrain Model,
DTM), geological stratum model and three-dimensional object surface modeling etc..
In the subsequent applications of TIN model, TIN is split using closure or non-closed multi-section-line as boundary, is cut
It is the higher operation of frequency of use, in the process, in order to realize Accurate Segmentation or cutting, needs more based on TIN interpolation calculation
The intersection point and elevation of section line vertex elevation, multi-section-line and TIN intermediate cam shape composition side, it may be assumed that multi-section-line is embedded in TIN.With height
The development of Precision Survey Technology and the continuous improvement of TIN modeling accuracy, TIN data scale is increasing, cuts, divides to TIN
The time efficiency of subsequent applications operation such as to cut higher requirements are also raised, and multi-section-line is embedded in TIN and cuts, divides as TIN
How basic algorithm realizes the quick insertion of multi-section-line, it has also become urgent problem to be solved under the conditions of TIN data volume is larger.
Summary of the invention
Based on the above the deficiencies in the prior art, the problem to be solved by the present invention is that providing a kind of based on straight line voxel time
The multi-section-line insertion TIN algorithm for going through principle, using straight line voxel traversal principle building multi-section-line composition straightway and TIN intermediate cam
The tight space Grid Index on shape side, unnecessary intersection detection calculates during reducing multi-section-line insertion TIN, it is ensured that TIN is cut out
It cuts and cutting operation time efficiency with higher in the larger situation of data scale.
In order to solve the above-mentioned technical problem, the present invention is achieved through the following technical solutions:
The present invention provides a kind of multi-section-line insertion TIN algorithm based on straight line voxel traversal principle, comprising the following steps:
S1: multi-section-line and TIN spatial index are established；
S2: multi-section-line is embedded in TIN.
Optionally, the step S1 includes:
S11: vertex spatial grid index is established；
S12: side spatial grid index is established；
S13: TIN intermediate cam shape spatial grid index is established.
Optionally, the step S2 includes:
S21: multi-section-line vertex elevation is calculated；
S22: multi-section-line and TIN triangle intersection are calculated.
Further, the step S11 includes:
If the plane coordinates on certain vertex is (x0,y0), include the minimum external square in modeling data domain including TIN and multi-section-line
The coordinate of shape lower-left angle point is (xmin,ymin), grid unit side length is cellSize, then the position of indexing units lattice where the vertex
It sets, i.e. the row coordinate rowId of cell and column coordinate colId is calculated as follows:
Further, the specific steps of step S12 are as follows:
S121: primary axis is determined；
If the starting point coordinate on side is (x1, y1), terminal point coordinate is (x2, y2), the distance dx=of Origin And Destination x-axis direction |
x2-x1|, the distance dy=in y-axis direction | y2-y1|, if dx > dy, x-axis is primary axis, and otherwise, y-axis is primary axis；
S122: cell where the starting point of side is determined；
S123: the cell that side is passed through is calculated；
Side starting point V1Its opposite distance of place cell lower-left angular vertex along the x-axis direction is xs, distance along the y-axis direction
For ys, side and starting point cell right edge intersection point V2Height h relative to lower-left angular vertexy0Are as follows:
Compare hy0With starting point cell upper right angular vertex P0Height eyRelationship, if hy0>ey, then starting point cell is passed through on side
Upper adjacent cell and upper right neighbour cell, otherwise, while passing through right adjacent cell.
Further, step S123 further include:
Before reaching home, the intersecting point coordinate of side and its passed through cell is in x-axis direction with step-lengthIt is incremented by,
In y-axis direction accumulation calculating as the following formula:
Cell coordinate indicates that starting point cell coordinate is r with row and column ID0, c0, intersection point V2Height is hy0, play dot element
Lattice (r0, c0) upper right angular vertex P0Height is ey, due to hy0<ey, so cell (r is passed through on side0, c0) right adjacent cell (r0, c0+
1), then with (r0, c0It+1) is current cell, intersection point V3Height be hy0, cell (r0+ 1, c0+ 1) its upper right angular vertex P1
Height is still ey, hy0>ey, then current cell (r is passed through on side0, c0+ 1) upper adjacent cell (r0+ 1, c0+ 1) with upper right neighbour unit
Lattice (r0+ 1, c0+2)；
It is calculated by the above process until cell where the terminal of side.
Optionally, the step S21 judges that algorithm traversal and interpolation vertex are adjacent using point and triangle position relationship
In the triangle of the same indexing units lattice, to realize the quick positioning to polygon vertex.
The step S22 judges whether two straightways intersect using directed angle direction method；
If two straightway AB intersect with CD, vector AC to AD, the oriented angular direction of vector BC to BD and vector CA
It is necessarily different to the oriented angular direction of CB, DA to DB, it may be assumed that
(1)[(xC-xA)·(yD-yA)-(xD-xA)·(yC-yA)]·[(xC-xB)·(yD-yB)-(xD-xB)·(yC-
yB)]≤0
(2)[(xA-xC)·(yB-yC)-(xB-xC)·(yA-yC)]·[(xA-xD)·(yB-yD)-(xB-xD)·(yA-
yD)]≤0
When above two formula is set up, then straightway AB intersects with CD；
To the straightway for determining intersection, intersection point is calculated using following methods:
The coordinate of straightway AB and two endpoints of CD is respectively (xA, yA), (xB, yB), (xC, yC), (xD, yD), then intersection point
Coordinate (x0, y0) are as follows:
Multi-section-line each group is calculated and is in line section and after TIN triangle respectively forms the intersection point plane coordinates on side, it can be into one
Step obtains the height value of intersection point using linear interpolation.
By upper, the multi-section-line insertion TIN algorithm of the invention based on straight line voxel traversal principle is in building multi-section-line and TIN
When spatial index, applicable line voxel traversal principle is associated with the be in line side of section and TIN intermediate cam shape of multi-section-line each group only
Its practical indexing units lattice passed through, thus the time caused by detection meaningless during reducing multi-section-line insertion TIN calculates
Waste, greatly improves the time efficiency of the operations such as subsequent cutting, segmentation, and applicable line voxel traversal principle constructs multi-section-line
With the spatial index of triangle, make be embedded in multi-section-line composition straightway and TIN intermediate cam shape side only with its practical rope passed through
Draw cell association, reduce multi-section-line and be embedded in during TIN time waste caused by largely unnecessary intersection detection calculations,
The time efficiency for improving multi-section-line insertion TIN algorithm there is certain reference to anticipate other related fieldss based on TIN structure mould
Justice and application value.
The above description is only an overview of the technical scheme of the present invention, in order to better understand the technical means of the present invention,
And it can be implemented in accordance with the contents of the specification, and in order to allow above and other objects, features and advantages of the invention can
It is clearer and more comprehensible, below in conjunction with preferred embodiment, and cooperates attached drawing, detailed description are as follows.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, the attached drawing to embodiment is simply situated between below
It continues.
Fig. 1 is that the multi-section-line of the invention based on straight line voxel traversal principle is embedded in TIN algorithm flow chart；
Fig. 2 is to calculate side indexing units lattice schematic diagram, wherein (a) is the cell within the scope of the minimum circumscribed rectangle of side；(b)
For the practical cell passed through in side；
Fig. 3 is to calculate side indexing units lattice schematic diagram；
Fig. 4 is that triangular mesh indexes schematic diagram, wherein (a) is the triangular mesh index based on minimum extraneous rectangle
Figure；It (b) is the triangular mesh index map based on straight line voxel traversal principle；
Fig. 5 is that vector directed angle calculates schematic diagram；
Fig. 6 is that multi-section-line is embedded in TIN figure, wherein (a) is the multi-section-line and landform TIN before being not embedded into TIN；It (b) is multistage
Line is embedded into landform TIN；
Fig. 7 is to be embedded in TIN algorithm cutting profile figure using multi-section-line, wherein (a) is hatching and stratum TIN；It (b) is embedding
Enter the hatching to each stratum TIN；
Fig. 8 is to be embedded in TIN algorithm using multi-section-line to cut landform TIN figure, wherein (a) is to cut multi-section-line and landform TIN；
It (b) is the landform TIN after cutting.
Specific embodiment
The embodiment of the invention will now be described in detail with reference to the accompanying drawings, and as part of this specification passes through
Embodiment illustrates the principle of the present invention, and other aspects of the present invention, feature and its advantage will become by the detailed description
It is very clear.In the attached drawing of institute's reference, the same or similar component is indicated using identical drawing reference numeral in different figures.
The present invention proposes and realizes a kind of multi-section-line insertion TIN algorithm based on straight line voxel traversal, and algorithm is constructing
Multi-section-line and when TIN spatial index, applicable line voxel traversal principle make multi-section-line each group be in line section and TIN intermediate cam shape
Side be only associated with its practical indexing units lattice passed through, to reduce meaningless detection meter during multi-section-line insertion TIN
The waste of time caused by calculation greatly improves the time efficiency of the operations such as subsequent cutting, segmentation, comprising:
Multi-section-line and TIN spatial index are established based on voxel traversal principle
The purpose for establishing TIN and multi-section-line spatial index is to realize the quick positioning of space geometrical element, accelerates subsequent behaviour
Make speed.In common spatial index, Grid Index be it is a kind of efficiently, the succinct and indexing means that are easily achieved, it is basic
Thought is that the minimum circumscribed rectangle of space geometrical element collection is divided into the space lattice being made of several cells, and will be to
(including TIN intermediate cam shape, triangle sets, at side, triangular apex, multi-section-line forms side, multistage to the space geometrical element of processing
Line vertex) it is assigned in corresponding grid cell according to spatial relation, to establish the Spatial Cable of space geometrical element collection
Draw.
The size of each cell determines associated space geometrical element quantity, cell in cell in spatial grid
It is excessive or it is too small all will affect efficiency of algorithm, be determined by experiment grid unit lattice size cellsize be TIN intermediate cam shape with
1.3 times of multi-section-line side length mean value.
The foundation of vertex spatial grid index
TIN intermediate cam shape and establishing for multi-section-line vertex Grid Index are fairly simple: set the plane coordinates on certain vertex as
(x0,y0), the coordinate comprising the modeling data domain minimum circumscribed rectangle lower-left angle point including TIN and multi-section-line is (xmin,ymin),
Grid unit side length is cellSize, then position (i.e. the row coordinate rowId of cell and the column of indexing units lattice where the vertex
Coordinate colId) it can be calculated as follows:
The foundation of side spatial grid index
When establishing the spatial grid index on side, a kind of more rough method is with the rope when minimum circumscribed rectangle is to determine
Draw cell, as shown in Fig. 2 (a), rectangle shown in dotted line is the minimum circumscribed rectangle of side AB in figure, then 16 in the rectangular extent
A cell is the indexing units lattice of side AB, and the AB practical cell passed through in side is only 7 lists shown in shade in Fig. 2 (b)
First lattice.
As it can be seen that with while minimum circumscribed rectangle to determine while indexing units lattice range it is excessive, can be because in subsequent applications
Efficiency of algorithm is influenced to there are a large amount of unnecessary detections calculating.
In order to improve the whole efficiency of multi-section-line insertion TIN algorithm, the present invention is based on space line voxel traversal principles to build
The Grid Index of stile makes the side of TIN intermediate cam shape and multi-section-line only establish index with its practical grid unit lattice passed through and closes
System, the specific steps are as follows:
(1) primary axis is determined；
If the starting point coordinate on side is (x1, y1), terminal point coordinate is (x2, y2), the distance dx=of Origin And Destination x-axis direction |
x2-x1|, the distance dy=in y-axis direction | y2-y1|, if dx > dy, x-axis be primary axis, otherwise, y-axis be primary axis (dx,
There are other 7 kinds of relationships between dy, as space is limited, the present invention is only with dx > dy and x2>x1, y2>y1For, other 7 kinds of situation originals
Reason is identical with this).
(2) cell where determining side starting point with formula of the present invention (1)；
(3) cell passed through on side is calculated；
As shown in figure 3, side starting point V1Its opposite distance of place cell lower-left angular vertex along the x-axis direction is xs, along y-axis
The distance in direction is ys, side and starting point cell right edge intersection point V2Height h relative to lower-left angular vertexy0Are as follows:
Compare hy0With starting point cell upper right angular vertex P0Height eyRelationship, if hy0>ey, then starting point cell is passed through on side
Upper adjacent cell and upper right neighbour cell, otherwise, while passing through right adjacent cell.
Before reaching home, the intersecting point coordinate of side and its passed through cell is in x-axis direction with step-lengthIt is incremented by,
In y-axis direction accumulation calculating as the following formula:
In Fig. 3, cell coordinate is indicated with row and column ID, and starting point cell coordinate is r0, c0, intersection point V2Height is hy0, rise
Dot element lattice (r0, c0) upper right angular vertex P0Height is ey, due to hy0<ey, so cell (r is passed through on side0, c0) right adjacent cell
(r0, c0+ 1), then with (r0, c0It+1) is current cell, intersection point V3Height be hy0, cell (r0+ 1, c0+ 1) its upper right
Angular vertex P1Height is still ey, hy0>ey, then current cell (r is passed through on side0, c0+ 1) upper adjacent cell (r0+ 1, c0+ 1) and it is right
Upper neighbour's cell (r0+ 1, c0+2).It is calculated by the above process until cell where the terminal of side, can set up side and its reality
Pass through the index relative between cell.
The foundation of TIN intermediate cam shape spatial grid index is generally determined using Minimum Enclosing Rectangle method and is closed with triangle
The grid unit of connection.As shown in figure 4, certain triangle minimum circumscribed rectangle lower left corner apex coordinate is (x in TINmin, ymin), it is right
Upper angular vertex coordinate is (xmax, ymax), according to the lower left corner and the right side of the spatial grid that TIN and multi-section-line minimum circumscribed rectangle divide
Upper angular vertex is respectively (Xmin, Ymin), (Xmax, Ymax), then with the associated spatial grid index range of cells of the triangle are as follows:
9 cells that i.e. Fig. 4 (a) intermediate cam shape minimum circumscribed rectangle is covered are associated with triangle.
The present invention is when establishing TIN intermediate cam shape Grid Index, using the straight line voxel traversal principle, then in Fig. 4
Associated with triangle is only 6 indexing units lattice shown in Fig. 4 (b) shade.
Multi-section-line is embedded in TIN firstly the need of each vertex elevation of TIN interpolation calculation multi-section-line is based on, and then calculates multi-section-line
Each group is in line the intersection point and elevation of section and each side of TIN intermediate cam shape, and intersection point is inserted into multi-section-line vertex sequence
Correct position, the multi-section-line after by vertex elevation interpolation and being inserted into newly-increased intersection point are already embedded in TIN.
Polygon vertex elevation interpolation
When being based on TIN interpolation calculation multi-section-line vertex elevation, the multi-section-line vertex for being to solve interpolation first is fallen
Problem in TIN in which triangle, after the spatial index of multi-section-line and TIN has been established, using point and triangle position
Relationship judges that algorithm traversal is adjacent to the triangle of the same indexing units lattice with interpolation vertex, can be realized to polygon top
The quick positioning of point.
The judgement of point and triangle position relationship uses vector difference area method.Multi-section-line vertex M is associated in the same grid
The vector that tri- vertex Δ ABC of unit are constituted is respectivelyWithThen it can judge that vertex is by following rule
It is no to be located inside Δ ABC:
(1) meet one of the following conditions, point M is located inside Δ ABC；
(2) meet one of the following conditions, point M is located in triangle edges；
(3) conditions above is not satisfied, and point M is located at outside Δ ABC.
When determining that vertex is located at triangle interior, i.e., calculated using the plane equation that Atria vertex is constituted
The height value on multi-section-line vertex.
If the coordinate on tri- vertex Δ ABC is respectively (xA,yA,zA), (xB,yB,zB), (xC,yC,zC), thus 3 points can be true
Allocate face normal vectorAre as follows:
The then elevation z of interpolation vertex MMAre as follows:
Calculate multi-section-line and TIN triangle intersection
Established Grid Index is still utilized, quickly filters out and is in line the triangle that section may intersect with multi-section-line each group
Then shape calculates multi-section-line each group using straightway intersection algorithm and is in line the intersection point of section and each side of triangle.
Generally judging whether two straightways intersect can complete by repelling detection and across vertical detection.The present invention uses one
More easy directed angle direction method is planted to judge whether two straightways intersect.
Directed angle refers to total starting point ordered vector binary group (a, b), is rotated to by vector a to be overlapped with vector b and be passed through
Angle.As shown in figure 5, vectorWithThe sine value of directed angle θ can be calculated as follows:
If vectorRotate counterclockwise toIt is overlapped, then 0 °≤θ≤180 °, sin θ >=0；If vectorRotation clockwise
Go toIt is overlapped, then 180 °≤θ≤360 °, sin θ≤0.Due in (formula 6),Therefore, x need to only be calculated1y2-
x2y1It can determine vectorIt arrivesOriented angular direction be clockwise or counter-clockwise.
If two straightway AB intersect with CD, vector AC to AD, the oriented angular direction of vector BC to BD and vector CA
It is necessarily different to the oriented angular direction of CB, DA to DB, it may be assumed that
(1)[(xC-xA)·(yD-yA)-(xD-xA)·(yC-yA)]·[(xC-xB)·(yD-yB)-(xD-xB)·(yC-
yB)]≤0
(2)[(xA-xC)·(yB-yC)-(xB-xC)·(yA-yC)]·[(xA-xD)·(yB-yD)-(xB-xD)·(yA-
yD)]≤0
When above two formula is set up, then straightway AB intersects with CD.
To the straightway for determining intersection, intersection point is calculated using following methods.The coordinate of straightway AB and two endpoints of CD point
It Wei not (xA, yA), (xB, yB), (xC, yC), (xD, yD), then coordinate (the x of intersection point0, y0) are as follows:
Multi-section-line each group is calculated and is in line section and after TIN triangle respectively forms the intersection point plane coordinates on side, it can be into one
Step obtains the height value of intersection point using linear interpolation.
While calculating multi-section-line and TIN intermediate cam shape intersection point, intersection point is inserted by multi-section-line vertex using Furthest Neighbor
In sequence, a new multi-section-line is formed, so far, multi-section-line is already embedded in TIN.
Fig. 6 (a) show the multi-section-line before being not embedded into TIN and landform TIN, and Fig. 6 (b) is using inventive algorithm by multistage
After line is embedded into landform TIN.
Fig. 7 show application of the inventive algorithm in cutting geologic section, cuts geologic section using inventive algorithm
When, hatching is sequentially embedded in each geological stratum TIN first, then by cuing open under the multi-section-line plotting to certain visual angle of insertion
In the figure of face.
Fig. 8 show inventive algorithm and is cutting the application in TIN.When cutting TIN, will be cut using inventive algorithm
After multi-section-line is embedded in TIN, using the multi-section-line of insertion as clipping boundary, rebuilding the inside and outside two parts TIN of clipping boundary is
It can.
The spatial index of the building of applicable line voxel traversal principle multi-section-line and triangle of the present invention, makes to be embedded in multi-section-line group
The section that is in line only is associated with its practical indexing units lattice passed through with the side of TIN intermediate cam shape, reduces multi-section-line insertion TIN mistake
The time caused by a large amount of unnecessary intersection detection calculations wastes in journey, improves the time efficiency of multi-section-line insertion TIN algorithm.
In the subsequent applications operation for the TIN such as algorithm of the invention has been realized and has been applied to geologic section cutting, TIN is cut, to based on TIN
Other related fieldss of structure mould have certain reference and application value.
The above is a preferred embodiment of the present invention, cannot limit the right model of the present invention with this certainly
It encloses, it is noted that for those skilled in the art, without departing from the principle of the present invention, may be used also
To make several improvement and variation, these, which improve and change, is also considered as protection scope of the present invention.
Claims (8)
1. a kind of multi-section-line based on straight line voxel traversal principle is embedded in TIN algorithm, which comprises the following steps:
S1: multi-section-line and TIN spatial index are established；
S2: multi-section-line is embedded in TIN.
2. the multi-section-line based on straight line voxel traversal principle is embedded in TIN algorithm as described in claim 1, which is characterized in that institute
Stating step S1 includes:
S11: vertex spatial grid index is established；
S12: side spatial grid index is established；
S13: TIN intermediate cam shape spatial grid index is established.
3. the multi-section-line based on straight line voxel traversal principle is embedded in TIN algorithm as described in claim 1, which is characterized in that institute
Stating step S2 includes:
S21: multi-section-line vertex elevation is calculated；
S22: multi-section-line and TIN triangle intersection are calculated.
4. the multi-section-line based on straight line voxel traversal principle is embedded in TIN algorithm as claimed in claim 2, which is characterized in that institute
Stating step S11 includes:
If the plane coordinates on certain vertex is (x0,y0), it is left comprising the modeling data domain minimum circumscribed rectangle including TIN and multi-section-line
The coordinate of lower angle point is (xmin,ymin), grid unit side length is cellSize, then the position of indexing units lattice where the vertex,
That is the row coordinate rowId of cell and column coordinate colId is calculated as follows:
5. the multi-section-line based on straight line voxel traversal principle is embedded in TIN algorithm as claimed in claim 2, which is characterized in that step
The specific steps of rapid S12 are as follows:
S121: primary axis is determined；
If the starting point coordinate on side is (x1, y1), terminal point coordinate is (x2, y2), the distance dx=of Origin And Destination x-axis direction | x2-x1
|, the distance dy=in y-axis direction | y2-y1|, if dx > dy, x-axis is primary axis, and otherwise, y-axis is primary axis；
S122: cell where the starting point of side is determined；
S123: the cell that side is passed through is calculated；
Side starting point V1Its opposite distance of place cell lower-left angular vertex along the x-axis direction is xs, distance along the y-axis direction is ys,
Side and starting point cell right edge intersection point V2Height h relative to lower-left angular vertexy0Are as follows:
Compare hy0With starting point cell upper right angular vertex P0Height eyRelationship, if hy0>ey, then the upper of starting point cell is passed through on side
Adjacent cell and upper right neighbour cell, otherwise, while passing through right adjacent cell.
6. the multi-section-line based on straight line voxel traversal principle is embedded in TIN algorithm as claimed in claim 5, which is characterized in that step
Rapid S123 further include:
Before reaching home, the intersecting point coordinate of side and its passed through cell is in x-axis direction with step-lengthIt is incremented by, in y-axis
Direction accumulation calculating as the following formula:
Cell coordinate indicates that starting point cell coordinate is r with row and column ID0, c0, intersection point V2Height is hy0, starting point cell
(r0, c0) upper right angular vertex P0Height is ey, due to hy0<ey, so cell (r is passed through on side0, c0) right adjacent cell (r0, c0+
1), then with (r0, c0It+1) is current cell, intersection point V3Height be hy0, cell (r0+ 1, c0+ 1) its upper right angular vertex P1
Height is still ey, hy0>ey, then current cell (r is passed through on side0, c0+ 1) upper adjacent cell (r0+ 1, c0+ 1) with upper right neighbour unit
Lattice (r0+ 1, c0+2)；
It is calculated by the above process until cell where the terminal of side.
7. the multi-section-line based on straight line voxel traversal principle is embedded in TIN algorithm as claimed in claim 3, which is characterized in that institute
It states step S21 and judges that algorithm traversal is adjacent to the same indexing units lattice with interpolation vertex using point and triangle position relationship
Triangle, to realize quick positioning to polygon vertex.
8. the multi-section-line based on straight line voxel traversal principle is embedded in TIN algorithm as claimed in claim 3, which is characterized in that institute
Stating step S22 judges whether two straightways intersect using directed angle direction method；
If two straightway AB intersect with CD, vector AC to AD, the oriented angular direction of vector BC to BD and vector CA to CB,
The oriented angular direction of DA to DB is necessarily different from, it may be assumed that
(1)[(xC-xA)·(yD-yA)-(xD-xA)·(yC-yA)]·[(xC-xB)·(yD-yB)-(xD-xB)·(yC-yB)[≤0
(2)[(xA-xC)·(yB-yC)-(xB-xC)·(yA-yC)]·[(xA-xD)·(yB-yD)-(xB-xD)·(yA-yD)]≤0
When above two formula is set up, then straightway AB intersects with CD；
To the straightway for determining intersection, intersection point is calculated using following methods:
The coordinate of straightway AB and two endpoints of CD is respectively (xA, yA), (xB, yB), (xC, yC), (xD, yD), then the coordinate of intersection point
(x0, y0) are as follows:
Multi-section-line each group is calculated to be in line section and after TIN triangle respectively forms the intersection point plane coordinates on side, can further adopt
The height value of intersection point is obtained with linear interpolation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910507116.7A CN110223390B (en) | 2019-06-12 | 2019-06-12 | Multi-segment line embedding TIN algorithm based on linear voxel traversal principle |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910507116.7A CN110223390B (en) | 2019-06-12 | 2019-06-12 | Multi-segment line embedding TIN algorithm based on linear voxel traversal principle |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110223390A true CN110223390A (en) | 2019-09-10 |
| CN110223390B CN110223390B (en) | 2023-02-17 |
Family
ID=67816700
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910507116.7A Active CN110223390B (en) | 2019-06-12 | 2019-06-12 | Multi-segment line embedding TIN algorithm based on linear voxel traversal principle |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110223390B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110657855A (en) * | 2019-09-23 | 2020-01-07 | 广州市中海达测绘仪器有限公司 | Method and device for measuring earth volume, computer equipment and storage medium |
| CN111105496A (en) * | 2019-12-19 | 2020-05-05 | 昆明能讯科技有限责任公司 | High-precision DEM construction method based on airborne laser radar point cloud data |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5923777A (en) * | 1995-08-30 | 1999-07-13 | Samsung Electronics Co., Ltd. | Method for irregular triangle mesh representation of an image based on adaptive control point removal |
| JP2002083321A (en) * | 2000-09-11 | 2002-03-22 | Kokusai Kogyo Co Ltd | Three-dimensional terrain generating system using digital map data |
| US20040140991A1 (en) * | 2003-01-16 | 2004-07-22 | Hntb Ltd | Method and system for converting engineering data into 3D modeling data |
| CN1858803A (en) * | 2006-04-04 | 2006-11-08 | 天津大学 | Three dimension uniform model construction method of water conservancy hydropower engineering geological information |
| CN101046893A (en) * | 2007-01-26 | 2007-10-03 | 北京国泰清济科技发展有限公司 | Quick irregular triangle network generating method |
| EP2293252A1 (en) * | 2003-08-05 | 2011-03-09 | Geotechnos S.R.L. | Method to analyse the acoustic pollution |
| CN102682479A (en) * | 2012-04-13 | 2012-09-19 | 国家基础地理信息中心 | Method for generating three-dimensional terrain feature points on irregular triangulation network |
| CN102855663A (en) * | 2012-05-04 | 2013-01-02 | 北京建筑工程学院 | Method for building CSG (Constructive Solid Geometry) model according to laser radar grid point cloud |
| CN103226844A (en) * | 2013-05-16 | 2013-07-31 | 北京建筑工程学院 | Three-dimensional geological tunnel modeling method based on spatial data structure system |
| US20130271463A1 (en) * | 2010-10-11 | 2013-10-17 | Ian Curington | Triangle mesh compression |
| US20140244161A1 (en) * | 2011-06-01 | 2014-08-28 | Harman Becker Automotive Systems Gmbh | Method of Generating a Database for a Navigation Device, Method of Outputting a Three-Dimensional Map, and Navigation Device |
| CN106780749A (en) * | 2016-12-02 | 2017-05-31 | 中国科学院武汉岩土力学研究所 | Surface model construction method based on constraint DelaunayTIN interpolation algorithms |
| CN109191566A (en) * | 2018-08-22 | 2019-01-11 | 攀枝花学院 | Three-dimensional terraced fields modeling method based on TIN |
| CN109472870A (en) * | 2018-11-28 | 2019-03-15 | 东南大学 | One kind being based on grid reconstruction and the modified model matching method of more domains of influence |
-
2019
- 2019-06-12 CN CN201910507116.7A patent/CN110223390B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5923777A (en) * | 1995-08-30 | 1999-07-13 | Samsung Electronics Co., Ltd. | Method for irregular triangle mesh representation of an image based on adaptive control point removal |
| JP2002083321A (en) * | 2000-09-11 | 2002-03-22 | Kokusai Kogyo Co Ltd | Three-dimensional terrain generating system using digital map data |
| US20040140991A1 (en) * | 2003-01-16 | 2004-07-22 | Hntb Ltd | Method and system for converting engineering data into 3D modeling data |
| EP2293252A1 (en) * | 2003-08-05 | 2011-03-09 | Geotechnos S.R.L. | Method to analyse the acoustic pollution |
| CN1858803A (en) * | 2006-04-04 | 2006-11-08 | 天津大学 | Three dimension uniform model construction method of water conservancy hydropower engineering geological information |
| CN101046893A (en) * | 2007-01-26 | 2007-10-03 | 北京国泰清济科技发展有限公司 | Quick irregular triangle network generating method |
| US20130271463A1 (en) * | 2010-10-11 | 2013-10-17 | Ian Curington | Triangle mesh compression |
| US20140244161A1 (en) * | 2011-06-01 | 2014-08-28 | Harman Becker Automotive Systems Gmbh | Method of Generating a Database for a Navigation Device, Method of Outputting a Three-Dimensional Map, and Navigation Device |
| CN102682479A (en) * | 2012-04-13 | 2012-09-19 | 国家基础地理信息中心 | Method for generating three-dimensional terrain feature points on irregular triangulation network |
| CN102855663A (en) * | 2012-05-04 | 2013-01-02 | 北京建筑工程学院 | Method for building CSG (Constructive Solid Geometry) model according to laser radar grid point cloud |
| CN103226844A (en) * | 2013-05-16 | 2013-07-31 | 北京建筑工程学院 | Three-dimensional geological tunnel modeling method based on spatial data structure system |
| CN106780749A (en) * | 2016-12-02 | 2017-05-31 | 中国科学院武汉岩土力学研究所 | Surface model construction method based on constraint DelaunayTIN interpolation algorithms |
| CN109191566A (en) * | 2018-08-22 | 2019-01-11 | 攀枝花学院 | Three-dimensional terraced fields modeling method based on TIN |
| CN109472870A (en) * | 2018-11-28 | 2019-03-15 | 东南大学 | One kind being based on grid reconstruction and the modified model matching method of more domains of influence |
Non-Patent Citations (3)
| Title |
|---|
| ZHAO JINGCHANG 等: "TIN Intersection Algorithm Based on Spatial Index and Collision Detection", 《COMPUTER ENGINEERING》 * |
| 朱娟 等: "道路模型与TIN地形无缝融合算法研究", 《微计算机信息》 * |
| 赵景昌 等: "基于空间索引与碰撞检测的TIN求交算法", 《计算机工程》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110657855A (en) * | 2019-09-23 | 2020-01-07 | 广州市中海达测绘仪器有限公司 | Method and device for measuring earth volume, computer equipment and storage medium |
| CN110657855B (en) * | 2019-09-23 | 2021-06-04 | 广州市中海达测绘仪器有限公司 | Method and device for measuring earth volume, computer equipment and storage medium |
| CN111105496A (en) * | 2019-12-19 | 2020-05-05 | 昆明能讯科技有限责任公司 | High-precision DEM construction method based on airborne laser radar point cloud data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110223390B (en) | 2023-02-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110030951B (en) | Water diversion shaft defect detection method based on three-dimensional laser scanning technology | |
| CN101582173B (en) | Block model building method for complex geological structure | |
| CN103020342B (en) | Method for extracting contour and corner of building from ground LiDAR data | |
| Morgan et al. | Interpolation of lidar data and automatic building extraction | |
| CN110717983A (en) | Building facade three-dimensional reconstruction method based on knapsack type three-dimensional laser point cloud data | |
| CN105787977B (en) | The method that building vector boundary simplifies | |
| CN103217688B (en) | Airborne laser radar point cloud adjustment computing method based on triangular irregular network | |
| CN106887020A (en) | A kind of road vertical and horizontal section acquisition methods based on LiDAR point cloud | |
| CN108508900A (en) | A kind of wall-surface mobile robot wall detection autonomous path planning method | |
| CN109960269A (en) | A kind of simplification environmental modeling method for serving unmanned plane independent navigation | |
| CN103278115B (en) | A kind of method and system calculating silt arrester siltation volume based on DEM | |
| CN104318618B (en) | Three-dimensional sectioning method of generalized tri-prism spatial data model | |
| CN109146990B (en) | Building outline calculation method | |
| CN108629228A (en) | A kind of road object identifying method and device | |
| CN110223390A (en) | A kind of multi-section-line insertion TIN algorithm based on straight line voxel traversal principle | |
| CN108805350A (en) | Search and rescue horizon prediction method based on multidimensional Monte Carlo theory | |
| CN105069824B (en) | Surface mine road network method for auto constructing and system based on gps data | |
| CN110032771A (en) | A kind of accurate method of cutting out of open coal mine DEM for taking local detail feature into account | |
| CN105095540A (en) | Normal plane scanning analytical method for inter-well relative position relations | |
| CN107705002B (en) | Method for determining influence range of abnormal high value of sampling point of heavy metal content in mining area soil | |
| CN112767352A (en) | High-voltage line tower automatic fine extraction method for airborne LiDAR power inspection | |
| Schäfer et al. | Automatic generation of topological indoor maps for real-time map-based localization and tracking | |
| CN101866015B (en) | Creating device of petroleum seismic structural map | |
| CN110221359A (en) | A kind of method of automatic identification shear line | |
| CN104457691A (en) | Method for obtaining elevation information of main building body |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20190910 Assignee: Fuxin Mining Institute Open Mining Technology Co.,Ltd. Assignor: LIAONING TECHNICAL University Contract record no.: X2023210000114 Denomination of invention: A Multisegment Embedding TIN Algorithm Based on the Principle of Line Voxel Traverse Granted publication date: 20230217 License type: Exclusive License Record date: 20230915 |