CN108280863A - TIN model equivalence line search methods based on bilateral structure - Google Patents
TIN model equivalence line search methods based on bilateral structure Download PDFInfo
- Publication number
- CN108280863A CN108280863A CN201810028669.XA CN201810028669A CN108280863A CN 108280863 A CN108280863 A CN 108280863A CN 201810028669 A CN201810028669 A CN 201810028669A CN 108280863 A CN108280863 A CN 108280863A
- Authority
- CN
- China
- Prior art keywords
- isopleth
- search
- line
- bilateral structure
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/203—Drawing of straight lines or curves
-
- 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
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Geometry (AREA)
- Software Systems (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Remote Sensing (AREA)
- Computer Graphics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of TIN model equivalence line search methods based on bilateral structure, include the following steps：The TIN models that bilateral structure is built based on discrete points data carry out ascending sort while each point is added in TIN models according to its discrete point value Z；The minimum Z values and greatest z value in the set after sequence are taken, is denoted as Zmin and Zmax respectively；According to the incoming equivalent spacing parameter d in outside, calculate tracking in need isopleth；It searches for isopleth first element successively since ArrayZ, discrete data is pre-processed first before search each isopleth, eliminates the data that may lead to error in search process because there is ambiguity.The present invention is based on the powerful topological relations of bilateral structure, can isopleth quickly be tracked according to the topological relation migration for replying side, ambiguity in preferable processing tracing process can find the appearance that all isopleth avoid illegal isopleth further through triangle filtering.
Description
Technical field
The present invention relates to application business systems and computer software development field based on GIS, and in particular to one kind is based on
The TIN model equivalence line search methods of bilateral structure.
Background technology
Isopleth is widely used general in meteorology, geology, environment, planning, resource and its related field.It is by three-dimensional letter
Breath is shown to two dimensional surface, is the strong tools for carrying out the spatial analysis such as geographic element, the totality of element can be held from region
Variation characteristic and changing rule.However, the groundwater level isopleth Auto-Generation Tool under computer platform is not much and sees,
Current correlative study mainly has：(1) individual Algorithms for Generating Contourlines has respectively based on rectangle rule trellis algorithm and is based on
Irregular triangle network algorithm is not combined with GIS, therefore limit its scope of application due to being to generate independent picture；
(2) it is combined with other professional softwares, but separately installed isoplethes drawing is needed to show software；(3) equivalence being combined with GIS
Line automatic generating calculation has carried out generating research, but the algorithm based on rectangular mesh based on GIS isopleth using rectangle rule net
It needs in mesh point into row interpolation, and there are ambiguity and isopleth to pass through website when the 2nd article of equivalent side in search rectangular
When be not often inconsistent with measured value.
Bilateral structure is made of three objects：Vertex, one side of something, face, each object have pointer to be directed toward other objects, greatly
Cause direction situation as follows：
1, vertex objects：Including a pointer is directed away from its half of vertex->leaving.
2, half of object：Including a pointer halfedge- for being directed toward the vertex that it leaves>orgin.
One face (left hand rule) halfedge- corresponding to it>face.
The pointer of one twins for being directed toward it, halfedge->twins.
One next half of pointer for being directed toward it, halfedge->next.
3, face as：Including a pointer for being directed toward one side of something corresponding with it, face->halfedge.
In bilateral data structure can't save mesh side information, instead it is half of (half-edges,
DualEdge).It is to keep length constant a line, is divided into two one side of something in form（Because according to define side do not have width or
Person is at least unit width）.This two one side of something combine referred to as a line, that is, a line is equal to a pair of of one side of something.Half
While be directive, and a pair of of one side of something of a line has opposite direction.
Invention content
The purpose of the present invention is to provide a kind of TIN model equivalence line search methods based on bilateral structure, it is intended to be used for
It solves existing but algorithm based on rectangular mesh to need in mesh point into row interpolation, and the 2nd article of equivalent side in search rectangular
When there are be not often inconsistent with measured value when ambiguity and isopleth pass through website.
The invention is realized in this way：
The present invention provides a kind of TIN model equivalence line search methods based on bilateral structure, includes the following steps：
S1 builds the TIN models of bilateral structure based on discrete points data, according to it while each point is added in TIN models
Discrete point value Z carries out ascending sort；Until all discrete points are added in TIN models, the collection after note sequence is combined into
OrderZArray；
S2 takes minimum Z values and greatest z value in the set after sequence, is denoted as Zmin and Zmax respectively；According to outside it is incoming etc.
Be worth spacing parameter d, calculate tracking in need isopleth, which is denoted as ArrayZ={ Zmin, Zmin+d, Zmin+
2d, Zmin+3d, ... , Zmax}；
S3 searches for isopleth successively since ArrayZ first element, search each isopleth is before first to discrete
Data are pre-processed, and the data that may lead to error in search process because there is ambiguity are eliminated；In the equivalence of same value
During line search, the state for initializing all sides is available, the relationship on side and opposite side based on bilateral structure, in the triangles
Isopleth is searched for, if side is boundary, is stopped search, and is reversely searched again for from side is started；If side had been searched for, by it
State is set to unavailable；After the completion of one contour tracing, initial line is judged and has terminated the relationship on side, if the starting of isopleth
It is in the same triangle while with terminating, then it is assumed that the isopleth is closed, and addition point makes its closure, otherwise it is assumed that being out song
Line.
It is further, pretreated to data progress in the step S3 that the specific method is as follows：Note current search value is Z0,
The small original discrete point indexes of value ratio Z0 are quickly found out in OrderZArray using binary search, then since at index,
It traverses backward, searches whether existence value Z points identical with current value Z0, once Z values are more than current value Z0, that is, exit cycle, open
Beginning search isopleth is finely adjusted Z values if Z values are identical as Z0, in addition a small number, makes the two differ, and record
By the index value of modification data, it is denoted as ModifyIndex.
Further, the index value and original value that the discrete point of modification is preserved after fine tuning are completed in the equivalence line search
Afterwards, restore discrete point to original state.
Further, the specific method is as follows for search isopleth in the step S3：
S3.1 finds first in TIN models and plays initial line Edge0；
S3.2 marks the side to access, and judges that the side whether there is equivalent point, such as exists, which is added line collection
Line is closed to stop search if the side is boundary, it is no to go to step S3.3；If there is no then going to step S3.4；
S3.3 judges whether accessed as lower a line NextEdge in front, if do not accessed, go to step S3.2 after
Continuous cycle, otherwise goes to step S3.4；
S3.4 judges whether accessed as opposite side DualEdge in front, if do not accessed, goes to step S3.2 and continues
Cycle, otherwise exits cycle；
S3.5, it is above-mentioned after circulation terminates, you can a series of equivalent points since on the sides Edge0 are found, then from the sides Edge0
Opposite side DualEdge starts, and goes to step S3.2, then reversely looks for one time；
After S3.6, the step S3.5, you can a series of equivalent points are searched out, if only there are one point in line set Line,
Then ignore；If there is multiple points, connection generates isopleth.
Further, spline curve interpolation is carried out to the equivalent point set data of formation, forms final smooth isopleth
And it completes to draw display in generalized information system.
Further, in the above method, judge when the basis for estimation that whether there is equivalent point on front is as follows：For appointing
On one side, the Z values at both ends are not to be denoted as Z1 and Z2, which is Z1 there are the condition of equivalent point Z0< Z0 < Z2.
Further, in the step S1, discrete point is ranked up using the algorithm of the heapsort of optimization.
Compared with prior art, the invention has the advantages that：
This TIN model equivalence line search methods based on bilateral structure provided by the invention, before search to special circumstances into
It has gone quick processing, has eliminated the ambiguity in search process；Powerful topological relation based on bilateral structure can quickly basis return
Isopleth is tracked in the topological relation migration on multiple side, and the preferable ambiguity handled in tracing process can find all equivalences
Line avoids the appearance of illegal isopleth further through triangle filtering.
Description of the drawings
Fig. 1 is a kind of flow of the TIN model equivalence line search methods based on bilateral structure provided in an embodiment of the present invention
Figure.
Specific implementation mode
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation describes, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts all other
Embodiment shall fall within the protection scope of the present invention.
As shown in Figure 1, the embodiment of the present invention provides a kind of TIN model equivalence line search methods based on bilateral structure,
Middle discrete point is used（X, Y, Z）It indicates, XY indicates it in the position of two dimensional surface, Z expression values, this method includes following step
Suddenly：
S1 builds the TIN models of bilateral structure based on discrete points data, according to it while each point is added in TIN models
Discrete point value Z carries out ascending sort；Until all discrete points are added in TIN models, the collection after note sequence is combined into
OrderZArray；
S2 takes minimum Z values and greatest z value in the set after sequence, is denoted as Zmin and Zmax respectively；According to outside it is incoming etc.
Be worth spacing parameter d, calculate tracking in need isopleth, which is denoted as ArrayZ={ Zmin, Zmin+d, Zmin+
2d, Zmin+3d, ... , Zmax}；
S3 searches for isopleth successively since ArrayZ first element, search each isopleth is before first to discrete
Data are pre-processed, and the data that may lead to error in search process because there is ambiguity are eliminated；In the equivalence of same value
During line search, the state for initializing all sides is available, the relationship on side and opposite side based on bilateral structure, in the triangles
Isopleth is searched for, if side is boundary, is stopped search, and is reversely searched again for from side is started；If side had been searched for, by it
State is set to unavailable；After the completion of one contour tracing, initial line is judged and has terminated the relationship on side, if the starting of isopleth
It is in the same triangle while with terminating, then it is assumed that the isopleth is closed, and addition point makes its closure, otherwise it is assumed that being out song
Line.
This TIN model equivalence line search methods based on bilateral structure provided by the invention, to special feelings before search
Condition has carried out quick processing, eliminates the ambiguity in search process；Powerful topological relation based on bilateral structure, can quick root
Isopleth is tracked according to the topological relation migration for replying side, the preferable ambiguity handled in tracing process can be found all
Isopleth avoids the appearance of illegal isopleth further through triangle filtering.
Preferably, in the step S1, discrete point is ranked up using the algorithm of the heapsort of optimization.
As one of embodiment, pretreated to data progress in the step S3 the specific method is as follows：Note is currently searched
Rope value is Z0, the small original discrete point indexes of value ratio Z0 is quickly found out in OrderZArray using binary search, then from rope
Draw place to start, traverse backward, search whether existence value Z points identical with current value Z0, once Z values are more than current value Z0, that is, moves back
Go out cycle, start search isopleth and Z values are finely adjusted if Z values are identical as Z0, in addition a small number, makes the two not
Deng, and record by the index value of modification data, it is denoted as ModifyIndex.
Preferably, the index value and original value that the discrete point of modification is preserved after fine tuning, after the completion of the equivalence line search,
Restore discrete point to original state.
By being ranked up to discrete point, discrete point that may be equal with currently equal indication Z can be quickly positioned in search,
Its value is finely adjusted, and records the discrete point index of fine tuning, then after the completion of the contour tracing, modification trim values are original
Value, eliminates the ambiguity in search process.
Searching for isopleth as one of embodiment, in the step S3, the specific method is as follows：
S3.1 finds first in TIN models and plays initial line Edge0；
S3.2 marks the side to access, and judges that the side whether there is equivalent point, such as exists, which is added line collection
Line is closed to stop search if the side is boundary, it is no to go to step S3.3；If there is no then going to step S3.4；
S3.3 judges whether accessed as lower a line NextEdge in front, if do not accessed, go to step S3.2 after
Continuous cycle, otherwise goes to step S3.4；
S3.4 judges whether accessed as opposite side DualEdge in front, if do not accessed, goes to step S3.2 and continues
Cycle, otherwise exits cycle；
S3.5, it is above-mentioned after circulation terminates, you can a series of equivalent points since on the sides Edge0 are found, then from the sides Edge0
Opposite side DualEdge starts, and goes to step S3.2, then reversely looks for one time；
After S3.6, the step S3.5, you can a series of equivalent points are searched out, if only there are one point in line set Line,
Then ignore；If there is multiple points, connection generates isopleth.
Wherein, judge when the basis for estimation that whether there is equivalent point on front is as follows：For any side, the Z at both ends
Value is not to be denoted as Z1 and Z2, which is Z1 there are the condition of equivalent point Z0< Z0 < Z2.
This method further comprises, spline curve interpolation is carried out to the equivalent point set data of formation, is formed final smooth
Isopleth and in generalized information system complete draw display.
The application uses the algorithm based on irregular triangle network, overcomes the deficiency of rectangular mesh algorithm；Isopleth is painted
Processing procedure sequence is combined with GIS, may be used in the industries such as the hydrology and geology.
One of ordinary skill in the art will appreciate that all or part of step in the various methods of embodiment is can to lead to
It crosses program and is completed to instruct relevant hardware, which can be stored in a computer readable storage medium, storage medium
May include：Read-only memory（ROM, Read Only Memory）, random access memory（RAM, Random Access
Memory）, disk or CD etc..
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
With within principle, any modification, equivalent replacement, improvement and so on should all be included in the protection scope of the present invention god.
Claims (7)
1. a kind of TIN model equivalence line search methods based on bilateral structure, which is characterized in that include the following steps：
S1 builds the TIN models of bilateral structure based on discrete points data, according to it while each point is added in TIN models
Discrete point value Z carries out ascending sort；Until all discrete points are added in TIN models, the collection after note sequence is combined into
OrderZArray；
S2 takes minimum Z values and greatest z value in the set after sequence, is denoted as Zmin and Zmax respectively；According to outside it is incoming etc.
Be worth spacing parameter d, calculate tracking in need isopleth, which is denoted as ArrayZ={ Zmin, Zmin+d, Zmin+
2d, Zmin+3d, ... , Zmax}；
S3 searches for isopleth successively since ArrayZ first element, search each isopleth is before first to discrete
Data are pre-processed, and the data that may lead to error in search process because there is ambiguity are eliminated；In the equivalence of same value
During line search, the state for initializing all sides is available, the relationship on side and opposite side based on bilateral structure, in the triangles
Isopleth is searched for, if side is boundary, is stopped search, and is reversely searched again for from side is started；If side had been searched for, by it
State is set to unavailable；After the completion of one contour tracing, initial line is judged and has terminated the relationship on side, if the starting of isopleth
It is in the same triangle while with terminating, then it is assumed that the isopleth is closed, and addition point makes its closure, otherwise it is assumed that being out song
Line.
2. the TIN model equivalence line search methods based on bilateral structure as described in claim 1, it is characterised in that：The step
It is pretreated to data progress in rapid S3 that the specific method is as follows：
Note current search value is Z0, is quickly found out the small original discrete points of value ratio Z0 in OrderZArray using binary search
Index, then since at index, traverses, searches whether existence value Z points identical with current value Z0 backward, once Z values are more than
Current value Z0 exits cycle, start search isopleth and be finely adjusted to Z values if Z values are identical as Z0, in addition one micro-
Decimal makes the two differ, and records by the index value of modification data, is denoted as ModifyIndex.
3. the TIN model equivalence line search methods based on bilateral structure as claimed in claim 2, it is characterised in that：It is finely tuning
The index value and original value for preserving the discrete point of modification afterwards restore discrete point to original state after the completion of the equivalence line search.
4. the TIN model equivalence line search methods based on bilateral structure as described in claim 1, it is characterised in that：The step
The specific method is as follows for search isopleth in rapid S3：
S3.1 finds first in TIN models and plays initial line Edge0；
S3.2 marks the side to access, and judges that the side whether there is equivalent point, such as exists, which is added line collection
Line is closed to stop search if the side is boundary, it is no to go to step S3.3；If there is no then going to step S3.4；
S3.3 judges whether accessed as lower a line NextEdge in front, if do not accessed, go to step S3.2 after
Continuous cycle, otherwise goes to step S3.4；
S3.4 judges whether accessed as opposite side DualEdge in front, if do not accessed, goes to step S3.2 and continues
Cycle, otherwise exits cycle；
S3.5, it is above-mentioned after circulation terminates, you can a series of equivalent points since on the sides Edge0 are found, then from the sides Edge0
Opposite side DualEdge starts, and goes to step S3.2, then reversely looks for one time；
After S3.6, the step S3.5, you can a series of equivalent points are searched out, if only there are one point in line set Line,
Then ignore；If there is multiple points, connection generates isopleth.
5. the TIN model equivalence line search methods based on bilateral structure as claimed in claim 4, it is characterised in that：To being formed
Equivalent point set data carry out spline curve interpolation, form final smooth isopleth and complete to draw in generalized information system aobvious
Show.
6. the TIN model equivalence line search methods based on bilateral structure as claimed in claim 4, it is characterised in that：Above-mentioned side
In method, judge when the basis for estimation that whether there is equivalent point on front is as follows：For any side, the Z values at both ends are not remember
For Z1 and Z2, which is Z1 there are the condition of equivalent point Z0< Z0 < Z2.
7. the TIN model equivalence line search methods based on bilateral structure as described in claim 1, it is characterised in that：The step
In rapid S1, discrete point is ranked up using the algorithm of the heapsort of optimization.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810028669.XA CN108280863A (en) | 2018-01-12 | 2018-01-12 | TIN model equivalence line search methods based on bilateral structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810028669.XA CN108280863A (en) | 2018-01-12 | 2018-01-12 | TIN model equivalence line search methods based on bilateral structure |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108280863A true CN108280863A (en) | 2018-07-13 |
Family
ID=62803504
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810028669.XA Pending CN108280863A (en) | 2018-01-12 | 2018-01-12 | TIN model equivalence line search methods based on bilateral structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108280863A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109031235A (en) * | 2018-08-09 | 2018-12-18 | 南京信息工程大学 | The method of quick obtaining radar baseis reflectivity three-dimensional isopleth data |
| CN111986324A (en) * | 2020-08-20 | 2020-11-24 | 湖南胜昊软件科技有限公司 | Equivalent surface construction method based on meteorological elements |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103914618A (en) * | 2014-03-28 | 2014-07-09 | 哈尔滨工程大学 | Electronic chart based seawater depth contour line generating method |
| CN107256557A (en) * | 2017-05-03 | 2017-10-17 | 华南理工大学 | A kind of controllable subdivision curved surface image vector method of error |
| US20170365094A1 (en) * | 2016-04-04 | 2017-12-21 | University Of Cincinnati | Localized Contour Tree Method for Deriving Geometric and Topological Properties of Complex Surface Depressions Based on High Resolution Topographical Data |
-
2018
- 2018-01-12 CN CN201810028669.XA patent/CN108280863A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103914618A (en) * | 2014-03-28 | 2014-07-09 | 哈尔滨工程大学 | Electronic chart based seawater depth contour line generating method |
| US20170365094A1 (en) * | 2016-04-04 | 2017-12-21 | University Of Cincinnati | Localized Contour Tree Method for Deriving Geometric and Topological Properties of Complex Surface Depressions Based on High Resolution Topographical Data |
| CN107256557A (en) * | 2017-05-03 | 2017-10-17 | 华南理工大学 | A kind of controllable subdivision curved surface image vector method of error |
Non-Patent Citations (2)
| Title |
|---|
| 梁海云等: "基于TIN模型的等高线绘制及应用研究", 《河南测绘》 * |
| 赵景昌等: "一种基于TIN的等值线快速生成算法", 《计算机工程与应用》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109031235A (en) * | 2018-08-09 | 2018-12-18 | 南京信息工程大学 | The method of quick obtaining radar baseis reflectivity three-dimensional isopleth data |
| CN111986324A (en) * | 2020-08-20 | 2020-11-24 | 湖南胜昊软件科技有限公司 | Equivalent surface construction method based on meteorological elements |
| CN111986324B (en) * | 2020-08-20 | 2024-02-20 | 湖南胜昊软件科技有限公司 | Equivalent surface construction method based on meteorological elements |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101719140B (en) | Figure retrieving method | |
| CN113408634B (en) | Model recommendation method and device, equipment and computer storage medium | |
| CN103218817B (en) | The dividing method of plant organ point cloud and system | |
| US20080021882A1 (en) | Method and apparatus for retrieving a 3-dimensional model | |
| CN108073682A (en) | Based on parameter view functional query database | |
| CN109522585A (en) | A kind of adaptive layered method preventing 3D printing model characteristic offset | |
| JP3516145B2 (en) | System and method for improved parametric geometric modeling | |
| CN109584357A (en) | Three-dimensional modeling method, device, system and storage medium based on more contour lines | |
| CN106372393B (en) | A kind of assembly sequence-planning method of the Complex Assembly body based on assembly matrix | |
| CN105989079A (en) | Method and apparatus for obtaining device fingerprint | |
| CN108280863A (en) | TIN model equivalence line search methods based on bilateral structure | |
| CN110443285A (en) | The determination method, apparatus and computer storage medium of similar track | |
| CN110837115A (en) | Seismic identification method and device for lithology of land-facies mixed rock compact reservoir | |
| CN103617291B (en) | Equivalent characterization method for reservoir stratum cause unit interface | |
| Shen et al. | A framework from point clouds to workpieces | |
| CN106251364A (en) | Method for tracking target and device | |
| CN106445960A (en) | Data clustering method and device | |
| CN113903016B (en) | Bifurcation point detection method, bifurcation point detection device, computer equipment and storage medium | |
| CN112016956B (en) | Ore grade estimation method and device based on BP neural network | |
| CN102890830A (en) | Method for separating topological face based on triangular patch model | |
| CN112419493B (en) | Shale reservoir three-dimensional attribute model building method and device | |
| CN109840945B (en) | Finite element preprocessing method and device | |
| Hauser et al. | The state of the art in flow visualization, part 1: Direct, texture-based and geometric techniques | |
| CN100552722C (en) | Method for extracting multi-dimension curvature characteristic on triangle gridding | |
| CN110378352A (en) | The anti-interference two-dimensional filtering navigation data denoising method of high-precision in complicated underwater environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180713 |