Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Mass point cloud Delaunay triangulation network construction method based on double spatial data organization

A technology of spatial data and construction methods, applied in the field of geographic information, can solve problems such as limited practicality, inability to guarantee network construction efficiency, and inability to guarantee efficiency, so as to achieve the effect of enhancing adaptability and improving overall efficiency

Inactive Publication Date: 2018-01-30
NANJING NORMAL UNIVERSITY
View PDF0 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The first method organizes the point cloud point by point. Although the efficiency of network construction can be guaranteed, the efficiency of data organization is very low.
The latter method organizes the point cloud into a grid, which improves the efficiency of data organization, but cannot guarantee the efficiency of network construction.
Therefore, using a single spatial data organization method to preprocess point clouds will inevitably be constrained by the limitations of this data organization method itself, and cannot guarantee the efficiency of all links in the reconstruction process, so the practicability of the method is limited

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Mass point cloud Delaunay triangulation network construction method based on double spatial data organization
  • Mass point cloud Delaunay triangulation network construction method based on double spatial data organization
  • Mass point cloud Delaunay triangulation network construction method based on double spatial data organization

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0037] The technical solutions of the present invention will be described in detail below, but the protection scope of the present invention is not limited to the embodiments.

[0038] like figure 1 Shown, a kind of massive point cloud Delaunay triangulation network construction algorithm based on dual spatial data organization of the present invention comprises the following basic steps:

[0039] 1. Point cloud grid organization

[0040] Use the quadtree to organize the grid of the point cloud, which is realized by three complete traversals of the point cloud, such as figure 2 shown.

[0041] (1) The first traversal

[0042] Suppose the original input point cloud to be segmented is P={p i , i∈[1,n]}, where P i · x and P i y represents point p respectively iThe X and Y coordinates of P, find the maximum value of X and Y coordinates in P by traversing:

[0043] xmax=max(P i x), i∈[1,n], xmin=min(P i .x), i∈[1,n]

[0044] ymax=max(P i .y), i∈[1,n], ymin=min(P i .y)...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a mass point cloud Delaunay triangulation network construction method based on double spatial data organization. The method comprises four steps: point cloud grid organization,point cloud pointwise organization, point cloud Delaunay network construction and pipeline scheduling. According to the algorithm, the disadvantages of the conventional single spatial data organization method can be avoided, the requirements of the network construction method for the memory of the computer can be reduced, the adaptability of the network construction method to different point cloud distribution types can be enhanced and the efficiency of the network construction method can be enhanced.

Description

technical field [0001] The invention belongs to geographic information technology, and in particular relates to a method for constructing a massive point cloud Delaunay triangulation network based on dual spatial data organization. Background technique [0002] Delaunay Triangulated Irregular Network (D-TIN) refers to a series of adjacent and non-overlapping triangle sets, and the circumscribed circle of each triangle does not contain any other points in the area. The empty circumscribed circle feature of D-TIN makes the minimum interior angle of each triangle in D-TIN as large as possible, ensuring that there will not be too narrow and long triangles in D-TIN, making the construction of triangulation more reasonable and accurate, so it is called It is considered to be the optimal triangulation, and it is widely used in the fields of geographic information system, geology, computer graphics, computer simulation and virtual reality. [0003] With the continuous development o...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06T7/11G06T7/543
Inventor 周良辰刘年涛林冰仙闾国年
Owner NANJING NORMAL UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products