CN115619893A - Two-dimensional block cutting and searching method based on matrix expression - Google Patents
Two-dimensional block cutting and searching method based on matrix expression Download PDFInfo
- Publication number
- CN115619893A CN115619893A CN202210882469.7A CN202210882469A CN115619893A CN 115619893 A CN115619893 A CN 115619893A CN 202210882469 A CN202210882469 A CN 202210882469A CN 115619893 A CN115619893 A CN 115619893A
- Authority
- CN
- China
- Prior art keywords
- nodes
- matrix
- line segments
- searching
- block
- 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
- 239000011159 matrix material Substances 0.000 title claims abstract description 53
- 238000000034 method Methods 0.000 title claims abstract description 26
- 239000013598 vector Substances 0.000 claims description 6
- 239000011435 rock Substances 0.000 description 9
- 238000011160 research Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
Abstract
The invention discloses a two-dimensional block cutting and searching method based on a matrix expression, which comprises the steps of inputting segment basic information, carrying out intersection operation on all segments, dispersing two-dimensional segments, and establishing a matrix for describing all topological relations between nodes and the segments; clearing all line segments and nodes which can not form block boundaries according to the topological relation matrix, and establishing a topological relation matrix which only contains the block boundaries; and realizing two-dimensional block search by searching node numbers in the topological relation matrix. The block cutting and searching method can realize block searching in any shape, the block and the boundary range have a uniform expression, and two-dimensional full-space searching is realized.
Description
Technical Field
The invention relates to a two-dimensional block cutting and searching method, in particular to a two-dimensional block cutting and searching method based on a matrix expression. The invention belongs to the technical field of rock mass cutting, searching, calculating and graph geometry in geotechnical engineering.
Background
Jointed rock mass is a medium frequently encountered in geotechnical engineering, and the rock mass comprises a large number of structural surfaces (such as faults, joint cracks, layer surfaces and the like), and the structural surfaces are mutually overlapped to form a characteristic rock mass structure, so that the characteristics of deformation, strength, stability and the like of the jointed rock mass are determined. Therefore, how to describe the characteristics efficiently and quickly and realize efficient cutting and searching of the jointed rock mass is a premise and a foundation for developing related researches on the jointed rock mass.
Disclosure of Invention
In view of the above, the present invention provides a two-dimensional block cutting and searching method based on matrix expression.
In order to achieve the purpose, the invention adopts the following technical scheme: a two-dimensional block cutting and searching method based on a matrix expression comprises the following steps:
s1: establishing an initial information relation matrix in a vector description mode, performing intersection operation on all line segments, dispersing two-dimensional line segments, and establishing a matrix for describing all topological relations between nodes and the line segments;
s2: removing all line segments and nodes which cannot form the block boundary according to the topological relation matrix established in the step S1, and establishing a new topological relation matrix which only contains the block boundary;
s3: and searching the node numbers in the new topological relation matrix established in the step S2 to realize block searching.
In a preferred embodiment of the present invention, the specific method for establishing the matrix describing all topological relationships between the nodes and the line segments in step S1 is as follows:
s1.1: inputting initial basic information, wherein the initial basic information is a group of node information and a group of line segment information, each line segment consists of two nodes, and the node array does not contain nodes which are not used by the line segment;
s1.2: mutually intersecting each line segment, recording all intersection points, dispersing the line segments according to the intersection points to form line segments for searching blocks, and intersecting the dispersed line segments only at nodes;
s1.3: and establishing a matrix describing the topological relation between the nodes and the line segments on the basis of the nodes.
The specific method for establishing the new topological relation matrix only including the block boundary in the step S2 is as follows:
s2.1: based on the topological relation matrix between the points and the line segments established in the step S1, deleting the nodes which are used only once, and simultaneously deleting the line segments using the nodes;
s2.2: after deleting nodes and line segments which can not form a block, establishing a new topological relation matrix between the points and the line segments;
when a node is used by more than two line segments, the line segments in the matrix are sorted counterclockwise according to their corresponding space vectors.
The specific method for realizing the two-dimensional block search in the step S3 is as follows:
s3.1: traversing the judgment index of the directed line segment in the new topological relation matrix established in the step S2, namely recording the index of whether the line segment is used or not, when the judgment index is not 0, taking the node number as the block initial number i, taking another node of the line segment as the next node number j, and modifying the judgment index of the directed line segment to be 0 after use; taking j as i, repeating the previous operation until the searching obtains a node with the same initial number, closing the block body, and finishing the searching of 1 block body;
s3.2: repeating the step S3.1 until the judgment indexes of all directed line segments in the matrix are all changed into 0, and finishing the block body searching;
in the searching process, the block body and the boundary are distinguished according to the serial number sequence of the nodes in the block body, the nodes are the block body when being sorted according to the clockwise, and the nodes are the boundary when being sorted according to the counterclockwise.
The invention can realize the searching of the block body with any shape, the block body and the boundary range have a uniform expression, the searching of two-dimensional full space is realized, the searching speed is high, and a foundation is provided for developing the related research of jointed rock mass.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2A is the initial node information input by the present invention;
FIG. 2B is the initial line segment number entered by the present invention;
FIG. 3A illustrates node, line segment information and numbering prior to line segment intersection according to the present invention;
FIG. 3B is the node, segment information and numbering after the segment intersection of the present invention;
FIG. 4A is the relationship matrix after the invention removes nodes that are used only 1 time;
FIG. 4B is the node, line segment information and number after the invention removes the node that is used only 1 time;
FIG. 5 is a schematic diagram of the ordering of common node line segments according to spatial location relationships in accordance with the present invention;
fig. 6 is the overall process of the block search of the present invention.
Detailed Description
The structure and features of the present invention will be described in detail below with reference to the accompanying drawings and examples. It should be noted that various modifications can be made to the embodiments disclosed herein, and therefore, the embodiments disclosed in the specification should not be construed as limiting the present invention, but merely as exemplifications of embodiments, which are intended to make the features of the present invention apparent.
As shown in fig. 1, the two-dimensional block cutting and searching method based on the matrix expression provided by the present invention comprises:
s1: establishing an initial information relation matrix in a vector description mode, performing intersection operation on all line segments, dispersing two-dimensional line segments, and establishing a matrix for describing all topological relations between nodes and the line segments, wherein the method specifically comprises the following steps:
s1.1: initial basic information is input, the initial basic information is a group of node information and a group of line segment information, each line segment consists of two nodes, and in order to guarantee the data tightness, the node array does not contain nodes which are not used by the line segments.
As shown in fig. 2A and 2B, in the preferred embodiment of the present invention, the number of the input initial nodes is 16, i.e., node 1 to node 16. The number of initial segments is 10, i.e., segments 1-10, each segment consisting of two nodes.
S1.2: and mutually intersecting each line segment, recording all intersection points, dispersing the line segments according to the intersection points to form line segments for searching the block body, and intersecting the dispersed line segments only at nodes.
As shown in fig. 3A and 3B, each line segment is intersected with each other to generate an intersection point 17 — an intersection point 25; and then, dispersing the line segments according to the intersection points to form new line segments for searching the block. For example, if the line segment 7 intersects the line segment 1, the line segment 10, and the line segment 9, and the line segment 7 has 3 intersections, the line segment 7 is discretized into 4 line segments, and the discretized line segments intersect only at the nodes.
S1.3: and establishing a matrix describing the topological relation between the nodes and the line segments on the basis of the nodes.
S2: clearing all line segments and nodes which can not form the block boundary according to the topological relation matrix established in the step S1, and establishing a new topological relation matrix which only contains the line segments and the nodes which can form the block boundary, wherein the specific method comprises the following steps:
s2.1: based on the topological relation matrix between the points and the line segments established in the step S1, deleting the nodes which are used only once, and simultaneously deleting the line segments using the nodes;
nodes 5-16 in fig. 3A are all used only once, so it is necessary to delete these nodes and the line segments containing these solutions. It should be noted that after the node and the line segment are deleted, a new node used only once may appear, and at this time, the above steps need to be repeated until there is no node used only once, as shown in fig. 4B, and fig. 4B renumbers the remaining nodes.
S2.2: and after deleting the nodes and line segments which can not form the block, establishing a new topological relation matrix between the points and the line segments.
When a node is used with more than 2 line segments, the line segments in the matrix are sorted counterclockwise by their corresponding space vectors, as shown in FIG. 5.
S3: two-dimensional loop search, namely search of a two-dimensional block, is realized through the node number in the new topological relation matrix established in the searching step S2, and the specific method comprises the following steps: the search process is as shown in figure 6,
s3.1: traversing the judgment index of the directed line segment in the new topological relation matrix established in the step S2, namely recording the index of whether the line segment is used or not, when the judgment index is not 0, taking the node number as the block initial number i, taking another node of the line segment as the next node number j, and modifying the judgment index of the directed line segment to be 0 after use; taking j as i, repeating the previous operation until the searching obtains a node with the same initial number, closing the block body, and finishing the searching of 1 block body;
s3.2: repeating the step S3.1 until the judgment indexes of all the directed line segments in the matrix become 0, and ending the block searching;
during searching, the block and the boundary are distinguished according to the numbering sequence of the nodes in the block, the nodes are the block when sorted according to the clockwise, and the nodes are the boundary when sorted according to the counterclockwise.
The invention can realize the search of the block body with any shape, the block body and the boundary range have a uniform expression, the search of two-dimensional full space is realized, the search speed is high, and a foundation is provided for the development of the related research of jointed rock mass.
Finally, it should be noted that: the above-mentioned embodiments are only used for illustrating the technical solution of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (4)
1. A two-dimensional block cutting and searching method based on a matrix expression is characterized in that: it comprises the following steps:
s1: establishing an initial information relation matrix in a vector description mode, performing intersection operation on all line segments, dispersing two-dimensional line segments, and establishing a matrix for describing all topological relations between nodes and the line segments;
s2: removing all line segments and nodes which cannot form the block boundary according to the topological relation matrix established in the step S1, and establishing a new topological relation matrix which only contains the block boundary;
s3: and searching the two-dimensional block by searching the node number in the new topological relation matrix established in the step S2.
2. The matrix expression based two-dimensional block cutting and searching method according to claim 1, wherein: the specific method for establishing the matrix describing all topological relations between the nodes and the line segments in the step S1 is as follows:
s1.1: inputting initial basic information, wherein the initial basic information is a group of node information and a group of line segment information, each line segment consists of two nodes, and the node array does not contain nodes which are not used by the line segment;
s1.2: mutually intersecting each line segment, recording all intersection points, dispersing the line segments according to the intersection points to form line segments for searching blocks, and intersecting the dispersed line segments only at nodes;
s1.3: and establishing a matrix for describing the topological relation between the nodes and the line segments on the basis of the nodes.
3. The matrix expression based two-dimensional block cutting and searching method according to claim 2, wherein: the specific method for establishing the new topological relation matrix only including the block boundary in the step S2 is as follows:
s2.1: based on the topological relation matrix between the points and the line segments established in the step S1, deleting the nodes which are used only once, and simultaneously deleting the line segments using the nodes;
s2.2: after deleting nodes and line segments which can not form a block, establishing a new topological relation matrix between the points and the line segments;
when a node is used by more than two segments, the segments in the matrix are sorted counterclockwise by their corresponding space vectors.
4. The two-dimensional block cutting and searching method based on the matrix expression of claim 3, wherein: the specific method for realizing the two-dimensional block search in the step S3 is as follows:
s3.1: traversing the judgment index of the directed line segment in the new topological relation matrix established in the step S2, namely recording the index of whether the line segment is used or not, when the judgment index is not 0, taking the node number as the block initial number i, taking another node of the line segment as the next node number j, and modifying the judgment index of the directed line segment to be 0 after use; taking j as i, repeating the previous operation until the searching obtains a node with the same initial number, closing the block body, and finishing the searching of 1 block body;
s3.2: repeating the step S3.1 until the judgment indexes of all directed line segments in the matrix are all changed into 0, and finishing the block body searching;
in the searching process, the block body and the boundary are distinguished according to the serial number sequence of the nodes in the block body, the nodes are the block body when being sorted according to the clockwise, and the nodes are the boundary when being sorted according to the counterclockwise.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210882469.7A CN115619893A (en) | 2022-07-26 | 2022-07-26 | Two-dimensional block cutting and searching method based on matrix expression |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210882469.7A CN115619893A (en) | 2022-07-26 | 2022-07-26 | Two-dimensional block cutting and searching method based on matrix expression |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115619893A true CN115619893A (en) | 2023-01-17 |
Family
ID=84857725
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210882469.7A Pending CN115619893A (en) | 2022-07-26 | 2022-07-26 | Two-dimensional block cutting and searching method based on matrix expression |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115619893A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100131251A1 (en) * | 2006-01-29 | 2010-05-27 | Fujitsu Limited | Shortest path search method and device |
| CN103065319A (en) * | 2012-12-31 | 2013-04-24 | 上海同岩土木工程科技有限公司 | Closed surface automatic search method of space multiply connected domain |
| CN107393005A (en) * | 2017-07-25 | 2017-11-24 | 中国科学院武汉岩土力学研究所 | A kind of three-dimensional rock block system modeling method |
| CN111681300A (en) * | 2020-06-02 | 2020-09-18 | 西安电子科技大学 | Method for obtaining target area composed of outline sketch lines |
-
2022
- 2022-07-26 CN CN202210882469.7A patent/CN115619893A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100131251A1 (en) * | 2006-01-29 | 2010-05-27 | Fujitsu Limited | Shortest path search method and device |
| CN103065319A (en) * | 2012-12-31 | 2013-04-24 | 上海同岩土木工程科技有限公司 | Closed surface automatic search method of space multiply connected domain |
| CN107393005A (en) * | 2017-07-25 | 2017-11-24 | 中国科学院武汉岩土力学研究所 | A kind of three-dimensional rock block system modeling method |
| CN111681300A (en) * | 2020-06-02 | 2020-09-18 | 西安电子科技大学 | Method for obtaining target area composed of outline sketch lines |
Non-Patent Citations (1)
| Title |
|---|
| 殷德胜;汪卫明;陈胜宏;: "三维岩石随机裂隙网络的块体自动识别", 长江科学院院报, no. 05, 15 October 2008 (2008-10-15), pages 1 - 6 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Thovert et al. | Computerized characterization of the geometry of real porous media: their discretization, analysis and interpretation | |
| Hinrichs et al. | The grid file: a data structure designed to support proximity queries on spatial objects | |
| CN111507024B (en) | Discrete element fluid-solid coupling numerical simulation method and system based on GPU matrix | |
| JPH01162927A (en) | Method of transitive closure, method of compressing data base, method and system for data base storage, method of producing data base and information supply system | |
| Balbiani et al. | Tractability results in the block algebra | |
| CN105426375A (en) | Relationship network calculation method and apparatus | |
| Benouamer et al. | Error-free boundary evaluation based on a lazy rational arithmetic: a detailed implementation | |
| JP3988925B2 (en) | Numerical analysis system using mixed grid type solution adaptive grid method | |
| CN106161106A (en) | A kind of node aggregation method and device being applied to oriented topological diagram | |
| Lee et al. | Parallel mesh simplification using embedded tree collapsing | |
| Galil et al. | Maintaining biconnected components of dynamic planar graphs | |
| CN108629001A (en) | A kind of De-weight method of geography information big data | |
| CN113704248B (en) | Block chain query optimization method based on external index | |
| CN102207964B (en) | Real-time massive data index construction method and system | |
| CN115619893A (en) | Two-dimensional block cutting and searching method based on matrix expression | |
| CN112509025A (en) | Method for calculating rock space structure distance map based on three-dimensional Euclidean distance | |
| CN115619961B (en) | Three-dimensional block cutting and searching method based on matrix expression | |
| CN105843809A (en) | Data processing method and device | |
| CN110807061A (en) | Method for searching frequent subgraphs of uncertain graphs based on layering | |
| CN110489448A (en) | The method for digging of big data correlation rule based on Hadoop | |
| CN111666689B (en) | Feature line tracking method, reactor core neutron physical calculation method and reactor core neutron physical calculation device | |
| Giammarresi et al. | Decremental 2-and 3-connectivity on planar graphs | |
| CN102298592A (en) | Method and device for managing list | |
| CN105677249A (en) | Data block partitioning method, device and system | |
| CN110362717A (en) | The target tracking method and system that can be changed based on more equipment time differences |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20230905 Address after: 430010 No.1, Liuhe Road, Jiang'an District, Wuhan City, Hubei Province Applicant after: CHINA THREE GORGES Corp. Applicant after: China Three Gorges Construction Engineering (Group) Co.,Ltd. Applicant after: China Institute of Water Resources and Hydropower Research Address before: 430010 No.1, Liuhe Road, Jiang'an District, Wuhan City, Hubei Province Applicant before: CHINA THREE GORGES Corp. Applicant before: China Institute of Water Resources and Hydropower Research |
|
| TA01 | Transfer of patent application right |