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

Vector contour line data partitioning method with space proximity relation considered

A technology of vector contours and spatial proximity, which is applied in the intersection of geographic information and parallel computing, can solve problems such as the inability to guarantee a relatively balanced data volume, achieve good spatial aggregation, reduce difficulty, and ensure load balancing.

Inactive Publication Date: 2014-05-07
NANJING NORMAL UNIVERSITY
View PDF2 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The spatial data division method based on the K-means clustering algorithm proposed by Jia Ting and Liu Runtao et al. This method divides the data that is guaranteed to be spatially adjacent to the same computing node, but this method cannot guarantee the amount of data on each computing node relatively balanced

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
  • Vector contour line data partitioning method with space proximity relation considered
  • Vector contour line data partitioning method with space proximity relation considered
  • Vector contour line data partitioning method with space proximity relation considered

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0034] The specific implementation of the vector contour data division method considering the spatial proximity relationship of the present invention will be described in detail below with reference to the figures.

[0035] Table 1 shows the basic variables used in the vector contour data division method of the present invention considering the spatial proximity relationship.

[0036] Table 1. Variable description of vector contour data division method

[0037]

[0038] The realization step of the inventive method is as figure 1 Shown:

[0039] Step 1, read the vector contour data, and quantitatively count the characteristics of the contour data, including: the number of contour data lines N l , the total number of points N p , the lowest elevation H of the contour data f , the highest elevation H of the contour data u , the number of points N of each line element pi , the elevation H of each line element i , the boundary coordinates of the smallest bounding rectangl...

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 vector contour line data partitioning method with the space proximity relation considered. The method comprises the steps of (1) reading contour line data and conducting quantitative statistics on the characteristics of the contour line data, (2) calculating the coordinates of the central point of the minimum enclosing rectangle of each contour line and expressing vector contour line data with a three-dimensional point provided with elevation information, (3) setting the number K of parallel computational nodes, (4) calculating the load threshold of each computational node in an ideal load balanced state and calculating the lower limit and the upper limit of the load thresholds, (5) selecting M (M=20K) points to serve as initial clustering central points, (6) clustering point features into M class clusters, (7) recalculating the coordinates of the central point of the M class clusters, (8) expressing the M class clusters with tetrads, (9) taking the tetrads as minimum data partitioning units and clustering the M tetrads into K class clusters, and (10) the end. According to the method, the data balancing principle is met, load balancing is guaranteed, and a high spatial clustering degree of partitioned data is guaranteed.

Description

technical field [0001] The invention belongs to the cross technical field of geographic information and parallel computing, in particular to a method for realizing data division and load balancing for vector contour data. Background technique [0002] With the development of geographic information acquisition technology, the scale of spatial data continues to expand, and the complexity of spatial calculations continues to increase. At the same time, the problems that people require GIS to solve are becoming more and more complex. The single GIS processing mode is no longer suitable for the new needs of massive data space operations. At the same time, with the continuous development of hardware technology and new applications, parallel computing systems have developed rapidly. For example, the development of multi-core architecture, the emergence of cloud computing mode, and the extension of GPU software and hardware technology provide indispensable support for the developmen...

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): G06F17/30G06F9/50
CPCG06F16/29
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