A fast delaunay network construction method for arbitrarily distributed large-scale point cloud data

A point cloud data, arbitrarily distributed technology, applied in the field of information processing, can solve the problems of reducing the speed of massive point cloud data Delaunay network construction, low algorithm processing efficiency, increasing the amount of calculation, etc., so as to reduce the search step size and improve the network construction efficiency. , the effect of reducing the amount of calculation
CN105654552BActive Publication Date: 2018-10-30THE FIRST INST OF OCEANOGRAPHY SOA
4 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
THE FIRST INST OF OCEANOGRAPHY SOA
Publication Date
2018-10-30

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention provides a fast Delaunay triangulation method for arbitrarily-distributed large-scale point cloud data, comprising the following steps: dividing a multi-grid to create an initial triangulated network; inserting points one by one; updating the triangulated network; and deleting auxiliary triangles to complete Delaunay triangulation. Through multi-grid division and a sorting method through sequential grid traversing based on a Hilbert curve, the search step length in the point positioning process and the number of finally-deleted long-narrow triangles produced in the triangulation process are reduced. By adopting a new algorithm in the point positioning process, the process of solving the centers of gravity and intersecting edges of triangles is avoided, and the amount of calculation is reduced. The efficiency of Delaunay triangulation under the condition of a large amount of point cloud data and uneven distribution thereof is improved greatly.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the technical field of information processing, in particular to a fast Delaunay network construction method oriented to arbitrarily distributed large-scale point cloud data. Background technique

[0002] Triangulation is one of the important research contents in the field of computational geometry. Among them, Delaunay triangulation has many excellent properties and has a wide range of applications in geographic information systems, digital elevation interpolation, finite element analysis, geometric reconstruction and other fields.

[0003] The construction methods of Delaunay triangulation can be divided into three types: point-by-point insertion method, divide-and-conquer algorithm and triangular network growing method. Among them, the triangular network growth method has been rarely used due to frequent traversal of data points, low time efficiency and complex algorithm. The advantage of the divide and conquer algorithm is ...

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