CN109299109A - A kind of storage of detail design point cloud data, quickly load, the method inquired - Google Patents
A kind of storage of detail design point cloud data, quickly load, the method inquired Download PDFInfo
- Publication number
- CN109299109A CN109299109A CN201811330181.9A CN201811330181A CN109299109A CN 109299109 A CN109299109 A CN 109299109A CN 201811330181 A CN201811330181 A CN 201811330181A CN 109299109 A CN109299109 A CN 109299109A
- Authority
- CN
- China
- Prior art keywords
- triangulation
- point cloud
- design data
- data
- storage
- 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
- 238000013461 design Methods 0.000 title claims abstract description 50
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000005516 engineering process Methods 0.000 claims abstract description 24
- 238000010276 construction Methods 0.000 abstract description 11
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000007547 defect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/10—Image acquisition modality
- G06T2207/10028—Range image; Depth image; 3D point clouds
Abstract
The present invention provides the methods of a kind of storage of detail design point cloud data, quickly load, inquiry, comprising the following steps: step (1): discrete design data point cloud is carried out triangulation；Step (2): the spatial index of the design data after establishing triangulation；Step (3): storing and inquires the design data after triangulation；Step (4): the overlapping relation of the design data after carrying out acquisition point, triangle, polygon and triangulation using database, inclusion relation and by inclusion relation, R*-TREE, 2D-delaunary, spatial index, sqlite technology are utilized the present invention provides a kind of, carries out the storage, load and the method quickly calculated of construction point cloud data.
Description
Technical field
The present invention relates to Beidou digitlization construction field, is applied to TX63 excavator Beidou construction guidance system, TD63 bulldozes
Machine Beidou construction guidance system.Specifically, the invention be exactly one kind can Data Structure and Algorithm, data structure can store
" DEM the or DTM point sets of discrete type detail design data ", and corresponding algorithm can rely on data structure, apply to realize
The quick load and calculating of work design data.
Background technique
In recent years, national basic engineering development is rapid, and domestic construction field is more next to construction quality, required precision
It is higher, while country advocates digitlization construction and information-aided construction.
Currently, often designing surface complicated, the complexity when carrying out the country using highway engineering construction in industry
Formula can be used a bit and calculated for surface, and have many surfaces that cannot be described with an explicit function.Therefore, generally
Discretization is carried out to the surface, then uses the data of discretization, interpolation solution is carried out to the data in boundary of works area.Traditional
Method is usually fixed step size method, while traditional road discretization mode has the following deficiencies: data volume is big, especially designs
Face is more complicated, required precision is higher, and point set is bigger.Data load is slow, searches and calculates slowly, is unable to satisfy making for digitlization construction
Use scene.The stability of Sqlite database file is high, is the standard configuration storage format of mobile terminal.
Summary of the invention
In order to solve above-mentioned insufficient defect, the present invention provides a kind of storage of detail design point cloud data, quickly plus
It carries, the method for inquiry, utilizes R*-TREE, 2D-delaunary, spatial index, sqlite technology the present invention provides a kind of, into
Storage, load and the method quickly calculated of row construction point cloud data；Point cloud data used in work progress is general at present
Bigger, this method depends on R*-TREE technology, sqlite memory technology, Spatial Data Index Technology, can be improved using the technology
The loading velocity and processing speed of data.
The present invention provides the methods of a kind of storage of detail design point cloud data, quickly load, inquiry, including following step
It is rapid:
Step (1): discrete design data point cloud is subjected to triangulation；
Step (2): the spatial index of the design data after establishing triangulation；
Step (3): storing and inquires the design data after triangulation；
Step (4): the phase of the design data after carrying out acquisition point, triangle, polygon and triangulation using database
Friendship relationship, inclusion relation and by inclusion relation.
Above-mentioned method, wherein be based on 2D delaunary technology, discrete design data point cloud is subjected to triangle and is cutd open
Point.
Above-mentioned method, wherein use R*-Tree technology, the spatial index of the design data after establishing triangulation.
Above-mentioned method, wherein use sqlite memory technology, store and inquire the triangulation after R*-Tree index
Design data afterwards.
The invention has the following advantages: 1, the method for the present invention can be realized the fast of " design data after triangulation "
Speed load, after tested, the design data with 140,000 triangles can load successfully in 60ms；The present invention is established
Spatial index, design data have 140,000 " delaunary triangle " on the basis of, may be implemented in 3ms determine point
The triangle at place.
Detailed description of the invention
Upon reading the detailed description of non-limiting embodiments with reference to the following drawings, the present invention and its feature, outer
Shape and advantage will become more apparent upon.Identical label indicates identical part in all the attached drawings.Not deliberately proportionally
Draw attached drawing, it is preferred that emphasis is show the gist of the present invention.
Fig. 1 is flow diagram provided by the invention.
Specific embodiment
In the following description, a large amount of concrete details are given so as to provide a more thorough understanding of the present invention.So
And it is obvious to the skilled person that the present invention may not need one or more of these details and be able to
Implement.In other examples, in order to avoid confusion with the present invention, for some technical characteristics well known in the art not into
Row description.
In order to thoroughly understand the present invention, detailed step and detailed structure will be proposed in following description, so as to
Illustrate technical solution of the present invention.Presently preferred embodiments of the present invention is described in detail as follows, however other than these detailed descriptions, this
Invention can also have other embodiments.
Shown in referring to Fig.1, the present invention provides the sides of a kind of storage of detail design point cloud data, quickly load, inquiry
Method, comprising the following steps:
Step (1): discrete design data point cloud is subjected to triangulation；
Step (2): the spatial index of the design data after establishing triangulation；
Step (3): storing and inquires the design data after triangulation；
Step (4): the phase of the design data after carrying out acquisition point, triangle, polygon and triangulation using database
Friendship relationship, inclusion relation and by inclusion relation.
In a preferred but unrestricted embodiment of the invention, the method for the present invention uses 2D delaunary technology, utilizes
Discrete design data point cloud is carried out triangulation by the technology；Using R*-Tree technology, it can establish " three using the technology
The spatial index of design data after the subdivision of angle "；Using sqlite memory technology, it can store using the technology and inquire R*-
" design data after triangulation " after Tree index；Using database technology, geometry, point, triangle, polygon are determined
The overlapping relation of " design data after triangulation ", inclusion relation and by inclusion relation.
In the present invention, the method for the present invention can be realized the quick load of " design data after triangulation ", after tested,
Design data with 140,000 triangles can load successfully in 60ms；Spatial index established by the present invention is being set
It counts on the basis of there are 140,000 " delaunary triangle ", may be implemented to determine the triangle where point in 3ms.
In a preferred but unrestricted embodiment of the invention, the method for the present invention uses 2D delaunary, R*-Tree skill
Art, sqlite memory technology.Design data can be carried out to " triangulation " using above-mentioned technology, established " after triangulation
The spatial index of design data ", and realize point, triangle, polygon and " design data after triangulation " overlapping relation,
Inclusion relation and quick calculating by inclusion relation.
Using 2D delaunary technology, design data is subjected to triangulation.
Using R*-Tree technology, the spatial index of " design data after triangulation " is established.
Use sqlite memory technology, memory space index.
Using database carry out acquisition point, triangle, polygon and " design data after triangulation " overlapping relation,
Inclusion relation and by inclusion relation.
Presently preferred embodiments of the present invention is described above.It is to be appreciated that the invention is not limited to above-mentioned
Particular implementation, devices and structures not described in detail herein should be understood as gives reality with the common mode in this field
It applies；Anyone skilled in the art, without departing from the scope of the technical proposal of the invention, all using the disclosure above
Methods and technical content many possible changes and modifications are made to technical solution of the present invention, or be revised as equivalent variations etc.
Embodiment is imitated, this is not affected the essence of the present invention.Therefore, anything that does not depart from the technical scheme of the invention, foundation
Technical spirit of the invention any simple modifications, equivalents, and modifications made to the above embodiment, still fall within the present invention
In the range of technical solution protection.
Claims (4)
1. a kind of storage of detail design point cloud data quickly loads, the method for inquiry, which comprises the following steps:
Step (1): discrete design data point cloud is subjected to triangulation；
Step (2): the spatial index of the design data after establishing triangulation；
Step (3): storing and inquires the design data after triangulation；
Step (4): the intersection of the design data after being carried out acquisition point, triangle, polygon and triangulation using database is closed
System, inclusion relation and by inclusion relation.
2. a kind of storage of detail design point cloud data as shown in claim 1 quickly loads, the method for inquiry, feature
It is, is based on 2D delaunary technology, discrete design data point cloud is subjected to triangulation.
3. a kind of storage of detail design point cloud data, quickly load, the method inquired, feature as shown in claim 2
It is, using R*-Tree technology, the spatial index of the design data after establishing triangulation.
4. a kind of storage of detail design point cloud data as stated in claim 3 quickly loads, the method for inquiry, feature
It is, using sqlite memory technology, stores and inquire the design data after the triangulation after R*-Tree index.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811330181.9A CN109299109A (en) | 2018-11-09 | 2018-11-09 | A kind of storage of detail design point cloud data, quickly load, the method inquired |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811330181.9A CN109299109A (en) | 2018-11-09 | 2018-11-09 | A kind of storage of detail design point cloud data, quickly load, the method inquired |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109299109A true CN109299109A (en) | 2019-02-01 |
Family
ID=65146853
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811330181.9A Pending CN109299109A (en) | 2018-11-09 | 2018-11-09 | A kind of storage of detail design point cloud data, quickly load, the method inquired |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109299109A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101447030A (en) * | 2008-11-12 | 2009-06-03 | 山东理工大学 | Method for quickly querying scattered point cloud local profile reference data |
| CN102609982A (en) * | 2012-01-20 | 2012-07-25 | 北京石油化工学院 | Topology discovery method of space geological data based on unstructured mode |
| CN107292935A (en) * | 2017-05-05 | 2017-10-24 | 深圳市建设综合勘察设计院有限公司 | Compression method, storage device and the laser radar of airborne high-density laser point cloud |
-
2018
- 2018-11-09 CN CN201811330181.9A patent/CN109299109A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101447030A (en) * | 2008-11-12 | 2009-06-03 | 山东理工大学 | Method for quickly querying scattered point cloud local profile reference data |
| CN102609982A (en) * | 2012-01-20 | 2012-07-25 | 北京石油化工学院 | Topology discovery method of space geological data based on unstructured mode |
| CN107292935A (en) * | 2017-05-05 | 2017-10-24 | 深圳市建设综合勘察设计院有限公司 | Compression method, storage device and the laser radar of airborne high-density laser point cloud |
Non-Patent Citations (3)
| Title |
|---|
| 孙殿柱等: "三维散乱点云的Voronoi拓扑近邻点集查询算法", 《武汉大学学报(信息科学版)》 * |
| 聂乐魁等: "海量散乱点云out-of-core快速均匀精简算法", 《制造业自动化》 * |
| 阎树田等: "反求工程中散乱点云的数据预处理技术", 《兰州理工大学学报》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104252489B (en) | A method of position character description information is quickly obtained according to longitude and latitude data | |
| CN109636893B (en) | Analysis and rendering method of three-dimensional OBJ model and MTL material in iPhone | |
| CN113593030B (en) | Geological profile generation method, system, terminal and medium based on three-dimensional model | |
| CN102799763B (en) | A kind of based on a cloud attitude standardized some cloud line feature extraction method | |
| CN101915570B (en) | Vanishing point based method for automatically extracting and classifying ground movement measurement image line segments | |
| CN105574931A (en) | Electronic map road drawing method and device | |
| CN105787977A (en) | Building vector boundary simplification method | |
| CN104331928A (en) | Automatic contour elevation value assignment method based on triangulation network | |
| CN111664864A (en) | Dynamic planning method and device based on automatic driving | |
| CN108364331A (en) | A kind of isopleth generation method, system and storage medium | |
| CN103817938A (en) | Rapid bridging method of polygonal area containing plurality of holes | |
| CN107705002B (en) | Method for determining influence range of abnormal high value of sampling point of heavy metal content in mining area soil | |
| CN106488401B (en) | Generate the method and device of seamless adjacent geography fence | |
| CN103256914A (en) | Method and system for calculating inundated areas of warp land dam based on DEM | |
| CN106802958B (en) | Conversion method and system of the CAD data to GIS data | |
| CN110414136B (en) | BIM-based bridge rapid modeling method and system | |
| CN107888907A (en) | One kind determines visual field method, system and a kind of determination visual field equipment | |
| CN107169080A (en) | A kind of geospatial analysis system being combined based on GIS and spatial database | |
| CN109299109A (en) | A kind of storage of detail design point cloud data, quickly load, the method inquired | |
| CN104834723A (en) | Display processing method and device of map | |
| CN107577720B (en) | Method for quickly querying point cloud data of underground roadway based on region tree | |
| Anil et al. | Experimental and finite element analyses of footings of varying shapes on sand | |
| CN104679765A (en) | Area coverage detecting method and area coverage detecting device | |
| CN102254093B (en) | Connected domain statistical correlation algorithm based on Thiessen polygon | |
| CN103714192B (en) | Big data quantity railway Three Dimensional Design Model rendering intent based on self adaptation R-tree |
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 |
Application publication date: 20190201 |
|
| RJ01 | Rejection of invention patent application after publication |