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

Delaunay Triangulation Parallel Network Construction Method Based on Rectangle Merge for Massive Point Cloud Data

A technology of point cloud data and triangular network, applied in the field of information processing, can solve the problems of complex convex hull boundary shape, failure to complete the network construction, overlapping triangles, etc., to improve the efficiency of network construction, reduce the number and reduce abnormal situations Effect

Inactive Publication Date: 2015-10-28
NANJING UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Due to the complex shape of the convex hull boundary, the processing of this type of merging algorithm needs to be more careful, and it is easier to generate cracks and overlapping triangles, which will lead to the failure of the final network construction to be completed smoothly.

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
  • Delaunay Triangulation Parallel Network Construction Method Based on Rectangle Merge for Massive Point Cloud Data
  • Delaunay Triangulation Parallel Network Construction Method Based on Rectangle Merge for Massive Point Cloud Data
  • Delaunay Triangulation Parallel Network Construction Method Based on Rectangle Merge for Massive Point Cloud Data

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0041] The Delaunay triangulation parallel network construction method based on rectangular mosaic for massive point cloud data of the present embodiment comprises the following steps:

[0042] The first step is to divide the planar space into rectangles to obtain several mutually spliced ​​rectangle areas, take all the points falling in the same rectangle area as the sub-point set of the rectangle area, insert corner points at the vertices of the divided rectangles, and divide the The corner point is added to the set of subpoints of the rectangular area adjacent to it.

[0043] This embodiment uses the adaptive rectangular fragmentation method based on grid statistics and binary trees, as follows:

[0044] 1) if figure 1 As shown, divide the plane space into M*N grids, traverse the data point set, calculate the row and column number of the grid to which each data point belongs, and count the number of data points in each grid, if the data point If it happens to fall on the ...

Embodiment 2

[0065] This embodiment is an improvement on the basis of Embodiment 1. The difference is that this embodiment is based on rectangular slices of plane space, adopts the master-slave mode, and implements the first step to the fifth step in Embodiment 1. To perform parallel processing, the specific method is:

[0066] ① The host divides the plane space into rectangles according to the given number of divisions, inserts corner points at the vertices of the divided rectangles, and adds the corner points to the sub-point set of its adjacent rectangular area;

[0067] ② For the idle slave processor, the host assigns a sub-point set to it through network communication, and performs Delaunay sub-triangular network calculation on the slave processor, and the master processor monitors its operation results;

[0068] ③ After the calculation of the slave processor is completed, the master processor receives the calculation results from the slave processor. If there are unallocated sub-poin...

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 relates to a Delaunay triangulation network parallel net-constructing method based on rectangular piecing towards magnanimity point cloud data. The method includes that firstly, a rectangular partition is carried out for planar space and a plurality of rectangular regions which are mutually put together are obtained. All points which fall in the same rectangular region are regarded as a sub point set of the rectangular region. An angular point is plugged into a position of the divided rectangular vertex and the vertex is added into a sub point set of the neighboring rectangular region. Secondly, a Delaunay triangulation sub-network is built over the sub point sets in which angular points are added. Thirdly, four angular points of the sub point set in each rectangular region are utilized for splicing all Delaunay triangulation sub-networks and a Delaunay triangulation network of the whole planar space is available. Fourthly, angular points which are added in the first step and the Delaunay triangles which are related with the angular points are deleted from the Delaunay triangulation network. Fifthly, the Delaunay triangulation network is carried out optimization so that the construction of the Delaunay triangulation network of the planar space is completed. The method has the advantages that the splicing process of the Delaunay triangulation sub-network is simplified and the efficiency of building the Delaunay triangulation network is improved.

Description

technical field [0001] The invention relates to a parallel network construction method of a Delaunay triangular network based on rectangle merging for massive point cloud data, and belongs to the technical field of information processing. Background technique [0002] The construction of irregular triangular network of any discrete point set in two-dimensional plane domain is an important content of GIS data expression, management, integration and visualization, and it is also an important technology in geoscience analysis, computer vision and other related fields. Among many triangulations, Delaunay triangulation is special, with the characteristics of empty circle and maximum and minimum angle, which ensures that there will not be too narrow and long triangles in Delaunay triangulation, making the construction of triangulation more reasonable and accurate. [0003] The unique advantages of Delaunay triangulation make its generation algorithm get more research. At present, ...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06F17/30
Inventor 王结臣杨再贵伍钟洁邝绮婷芮一康倪皓晨
Owner NANJING UNIV
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com