CN103809937A - Intervisibility parallel processing method based on GPU - Google Patents

Intervisibility parallel processing method based on GPU Download PDF

Info

Publication number
CN103809937A
CN103809937A CN201410038204.4A CN201410038204A CN103809937A CN 103809937 A CN103809937 A CN 103809937A CN 201410038204 A CN201410038204 A CN 201410038204A CN 103809937 A CN103809937 A CN 103809937A
Authority
CN
China
Prior art keywords
intervisibility
gpu
point
sight line
parallel processing
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.)
Granted
Application number
CN201410038204.4A
Other languages
Chinese (zh)
Other versions
CN103809937B (en
Inventor
徐筠
蔡继红
张进
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Simulation Center
Original Assignee
Beijing Simulation Center
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Simulation Center filed Critical Beijing Simulation Center
Priority to CN201410038204.4A priority Critical patent/CN103809937B/en
Publication of CN103809937A publication Critical patent/CN103809937A/en
Application granted granted Critical
Publication of CN103809937B publication Critical patent/CN103809937B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Processing Or Creating Images (AREA)
  • Multi Processors (AREA)

Abstract

The invention discloses an intervisibility parallel processing method based on a GPU. The intervisibility parallel processing method based on the GPU comprises the following steps: step 1, a GPU programming environment is created; step 2, a sight line connected with an observation point and a target point is calculated; step 3, data are written into the GPU; step 4, the intervisibility conditions of all points on each segment of the sight line are calculated in parallel; step 6, synchronization points are set; step 6, an intervisibility result is judged in parallel; step 7, the data are read out to a CPU. According to the intervisibility parallel processing method based on the GPU, a CPU and GPU heterogeneous mixed system structure can be supported, and efficient and parallel running of intervisibility calculation is realized through effective utilization of optimization resources such as a novel processor, a novel communicator and a novel synchronizer; by means of organically combing a CUDA structure with an intervisibility calculation method and fully utilizing the CUDA parallel storage and communication mechanism, a layered and parallel high-efficiency intervisibility method is realized, intervisibility calculation accuracy is guaranteed, and calculation time is effectively shortened at the same time.

Description

A kind of intervisibility method for parallel processing based on GPU
Technical field
The present invention relates to intervisibility method for parallel processing technical field, particularly a kind of based on GPU(Graphic Processing Unit, Graphics Processing Unit) intervisibility method for parallel processing.
Background technology
Intervisibility processing is in three dimensions, to calculate the intervisibility situation on line between any given 2, is requisite part in analogue system.Existing intervisibility disposal route take Grid DEM landform as basis form method more, for example Janus algorithm, Dyntacs algorithm, ModSAF algorithm and Bresenham algorithm, the principle of these intervisibility disposal routes is basically identical, difference is elevation interpolating method and intervisibility judgment principle, makes the precision of intervisibility processing and efficiency different.The intervisibility computing method of above-mentioned serial can not solve accuracy and two problems of rapidity that intervisibility calculates simultaneously.
Existing intervisibility is processed serial execution on CPU mostly, and its algorithm focuses on improving the efficiency of single sight line intervisibility computing method, but because intervisibility computation complexity is still O (N2), so efficiency improves and is not obvious.
Aspect intervisibility parallel processing, the people such as Ware adopt some Region Segmentation strategies on computer cluster, to realize parallel intervisibility and calculate; The people such as Kidner have designed a kind of triangle irregular network of multiple dimensioned implicit expression to support the intervisibility under multiple resolution to calculate; The people such as Mineter realize by set up complete intervisibility database in the distributed system of high-throughput parallel that intervisibility calculates.Above-mentioned intervisibility method for parallel processing all mainly focuses in distributed system and realizes parallel intervisibility processing, carries out the communication of intervisibility processing with synchronous by network.Therefore, the limited efficiency of above-mentioned intervisibility method for parallel processing is in the environmental baseline of distributed system.
Summary of the invention
The object of the invention is to provide a kind of intervisibility parallel calculating method based on GPU, solves the not high problem of intervisibility counting yield in existing analogue system, in guaranteeing computational accuracy, effectively reduces the time that intervisibility calculates.
Intervisibility method for parallel processing based on GPU provided by the invention comprises the steps:
S1: build GPU programmed environment;
S2: calculate the sight line that connects observation point and impact point;
S3: write data to GPU;
S4: every some intervisibility situation on parallel computation sight line line segment;
S5: synchronous point is set;
S6: walk abreast and judge intervisibility result;
S7: sense data is to CPU.
Preferably, described GPU programmed environment comprises hardware environment and software environment, and wherein hardware environment comprises CPU, supports the display chip of CUDA framework and connects the pci bus of CPU and display chip; Software environment comprises C/C++ compiler and CUDA.
Preferably, described step S2 comprises following sub-step:
S2.1: read in the position of observation point, position, the terrain data of observation point and the terrain data of impact point of impact point;
S2.2: determine by the sight line line segment of observation point and impact point on CPU;
S2.3: the position of observation point and impact point is converted to geocentric coordinate system from geographic coordinate system;
S2.4: calculate the sight line line segment between observation point and impact point under geocentric coordinate system.
Preferably, the terrain data of observation point and impact point respectively comprises longitude, latitude and height.
Preferably, described step S3 comprises following sub-step:
S3.1: the video memory that all data is written to GPU from the internal memory of CPU;
S3.2: large and that remain unchanged data volume terrain data is put into texture cache from video memory and accelerate to read;
S3.3: constant buffer memory is put into in frequent observation station of accessing and impact point position in calculating and accelerate to read.
Preferably, described step S4 comprises following sub-step:
In S4.1:GPU, a corresponding sight line line segment of thread block, distributes shared drive to preserve communication data;
S4.2: the thread mean allocation in each thread block is calculated the part discrete point in sight line;
S4.3: all threads are carried out identical discrete point intervisibility judgement simultaneously.
Preferably, described step S4.3 is: utilize interpolation computing method to be calculated the geocentric coordinate of corresponding discrete point by the geocentric coordinate of observation point and impact point, calculated longitude, latitude and the height of this discrete point by the geocentric coordinate of this discrete point, obtain the height of the landform of this discrete point position according to the longitude of this discrete point and latitude inquiry terrain data, by relatively judging whether the height of this discrete point is greater than the height of the landform of this discrete point position, and judged result is write to shared drive.
Preferably, described step S5 is: the thread in GPU is arranged to synchronous point, judge until the interior all threads of same thread block all complete every some intervisibility on sight line line segment the calculating that just continues next step.
Preferably, described step S6 is: the each thread block in GPU is by the intervisibility judged result in parallel traversal method shared drive, if the height of all discrete points is all greater than the height of the landform of this position in sight line, judge this sight line intervisibility, otherwise judge not intervisibility of this sight line, and the intervisibility result of this sight line is kept on the video memory of GPU.
Preferably, described step S7 is: the intervisibility judged result of all sight lines that GPU is obtained writes back CPU internal memory, copies to CPU internal memory from the video memory of GPU by pci bus.
The present invention has following beneficial effect:
Compared with the intervisibility method for parallel processing of prior art, intervisibility method for parallel processing of the present invention can be supported CPU, GPU heterogeneous mix architecture, effectively utilizes new types of processors, communication, synchronous etc. optimizes resource, realizes the efficient parallel operation that intervisibility calculates; By CUDA framework and intervisibility computing method are organically combined, make full use of the parallel storage of CUDA and communication mechanism, realize the high-effect intervisibility method of hierarchic parallel, when guaranteeing intervisibility computational accuracy, effectively reduce computing time.
Accompanying drawing explanation
The process flow diagram of the intervisibility method for parallel processing based on GPU that Fig. 1 provides for the embodiment of the present invention;
Fig. 2 is that the exchanges data of the intervisibility parallel calculating method based on GPU is moved towards schematic diagram;
Fig. 3 is tree-shaped addition schematic diagram.
Embodiment
Below in conjunction with drawings and Examples, summary of the invention of the present invention is further described.
As shown in Figure 1, the intervisibility method for parallel processing based on GPU that the present embodiment provides comprises the steps:
S1: build GPU programmed environment;
S2: calculate the sight line that connects observation point and impact point;
S3: write data to GPU;
S4: every some intervisibility situation on parallel computation sight line line segment;
S5: synchronous point is set;
S6: walk abreast and judge intervisibility result;
S7: sense data is to CPU.
In above-mentioned steps S1, GPU programmed environment comprises hardware environment and software environment, wherein hardware environment comprises CPU, supports the display chip of CUDA framework and connects the pci bus of CPU and display chip, and using CPU as main frame (host), using GPU as equipment (device); Software environment comprises C/C++ compiler and CUDA.
Above-mentioned steps S2 comprises following sub-step:
S2.1: read in the position of observation point, position, the terrain data of observation point and the terrain data of impact point of impact point; In the present embodiment, the terrain data of observation point and impact point respectively comprises longitude, latitude and height;
S2.2: determine by the sight line line segment of observation point and impact point on CPU;
S2.3: the position of observation point and impact point is converted to geocentric coordinate system from geographic coordinate system;
S2.4: calculate the sight line line segment between observation point and impact point under geocentric coordinate system.
The conversion relational expression that the position of observation point and impact point is converted to geocentric coordinate system from geographic coordinate system is:
X=(N+H) cos (B) cos (L) formula (1)
Y=(N+H) cos (B) sin (L) formula (2)
Z=[N (1-e_2_C)+H] sin (B) formula (3)
In formula (1), formula (2) and formula (3), (X, Y, Z) is the geocentric coordinate of observation point or impact point; L is observation point or the impact point longitude in geographic coordinate system; B is observation point or the impact point latitude in geographic coordinate system; H is observation point or the impact point height in geographic coordinate system; E_2_C is ellipsoid the first excentricity square, and
e _ 2 _ C = a 2 - b 2 a 2 Formula (4)
In formula (4), a is semimajor axis of ellipsoid; B is semiminor axis of ellipsoid; In the present embodiment, a=6378137.0; And b=6356752.3142.
In formula (1), formula (2) and formula (3), N is radius of curvature in prime vertical, and
N = a 1 - e _ 2 _ C * [ sin ( B ) ] 2 Formula (5)
Above-mentioned steps S3 is: the sight line line segment calculating on CPU and terrain data are copied on GPU, particularly, the storage space that can store sight line line segment and terrain data is set on the video memory of GPU, by pci bus, sight line line segment and terrain data is transferred to the storage space of the video memory of GPU from the internal memory of CPU.
Above-mentioned steps S3 comprises following sub-step:
S3.1: all data are written to the video memory of GPU from the internal memory of CPU, as shown in the label 1 in Fig. 2;
S3.2: large and that remain unchanged data volume terrain data is put into texture cache from video memory and accelerate to read, as shown in the label 2 in figure Fig. 2;
S3.3: constant buffer memory is put into in frequent observation station of accessing and impact point position in calculating and accelerate to read, as shown in the label 3 in figure Fig. 2.
Above-mentioned steps S4 comprises following sub-step:
In S4.1:GPU, a corresponding sight line line segment of thread block, distributes shared drive to preserve communication data;
S4.2: the thread mean allocation in each thread block is calculated the part discrete point in sight line;
S4.3: all threads are carried out identical discrete point intervisibility judgement simultaneously.
Above-mentioned steps S4.3 is: utilize interpolation computing method to be calculated the geocentric coordinate of corresponding discrete point by the geocentric coordinate of observation point and impact point, calculated longitude, latitude and the height of this discrete point by the geocentric coordinate of this discrete point, obtain the height of the landform of this discrete point position according to the longitude of this discrete point and latitude inquiry terrain data, by relatively judging whether the height of this discrete point is greater than the height of the landform of this discrete point position, and judged result is write to shared drive.
The conversion relational expression that the position of observation point and impact point is converted to geographic coordinate system from geocentric coordinate system is:
L = arctan ( Y X ) , X > 0 arctan ( Y X ) + &pi; , X < 0 , Y > 0 arctan ( Y X ) - &pi; , X < 0 , Y < 0 &pi; 2 , X = 0 , Y > 0 - &pi; 2 , X = 0 , Y < 0 Formula (6)
B = arctan [ Z + b * e _ 2 nd _ 2 _ C * sin ( &mu; ) 3 p - a * e _ 2 _ C * cos ( &mu; ) 3 ] ; Formula (7)
H = p * cos ( B ) + Z * sin ( B ) - a 1 - e _ 2 _ C * sin ( B ) 2 ; Formula (8)
In formula (6), formula (7) and formula (8), e_2nd_2_C is ellipsoid the second excentricity square, and
e _ 2 nd _ 2 _ C = a 2 - b 2 b 2 ; Formula (9)
p = X 2 + Y 2 ; Formula (10)
&mu; = arctan ( a * Z b * p ) . Formula (11)
Above-mentioned interpolation computing method is:
The computing formula of utilizing distance weighted method to calculate the height of interpolated point is:
z = &Sigma; i = 1 n ( z i d i 2 ) &Sigma; i = 1 n 1 d i 2 ; Formula (12)
In formula (12), n=4; z ifor the height of graticule mesh node; d ifor graticule mesh node is to the distance of interpolated point.The height of putting on graticule mesh limit adopts simple linear interpolation to calculate.Known two adjacent graticule mesh nodes are respectively A (x 1, y 1, z 1) and B (x 2, y 2, z 2), the planimetric coordinates of query point C is (x 0, y 0), put C (x 0, y 0, z 0) height be:
z 0 = ( z 2 - z 1 ) * S 1 S 2 ; Formula (13)
In formula (13), S 1for A point and the distance of C point time; S 2for the distance between A point and B point.
Above-mentioned steps S5 is: the thread in GPU is arranged to synchronous point, judge the calculating that just continues next step, to guarantee to read the correctness of intervisibility result until the interior all threads of same thread block all complete every some intervisibility on sight line line segment.In CUDA framework, realize the setting of synchronous point by fence (barrier), call syncthreads function.
Above-mentioned steps S6 is: the each thread block in GPU is by the intervisibility judged result in parallel traversal method shared drive, if the height of all discrete points is all greater than the height of the landform of this position in sight line, judge this sight line intervisibility, otherwise judge not intervisibility of this sight line, and the intervisibility result of this sight line is kept on the video memory of GPU.
As shown in Figure 3, above-mentioned parallel traversal method completes parallel computation by tree-shaped addition: by intervisibility result value of being designated as 0, not intervisibility result value of being designated as 1.By tree-shaped addition by the summation process parallelization of the intervisibility result of all threads.If tree-shaped addition rreturn value is 0, sight line intervisibility, otherwise not intervisibility of sight line.Sight line intervisibility result is write back to shared drive, as shown in the label 4 in Fig. 2.
Above-mentioned steps S7 is: the intervisibility judged result of all sight lines that GPU is obtained writes back CPU internal memory, copies to CPU internal memory from the video memory of GPU by pci bus.
The sight line intervisibility result in shared drive is write video memory by each thread block, as shown in the label 5 in Fig. 2; Then read video memory by CPU and obtain all intervisibility results, as shown in the label 1 in Fig. 2.
Should be appreciated that the above detailed description of technical scheme of the present invention being carried out by preferred embodiment is illustrative and not restrictive.Those of ordinary skill in the art modifies reading the technical scheme that can record each embodiment on the basis of instructions of the present invention, or part technical characterictic is wherein equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.

Claims (10)

1. the intervisibility method for parallel processing based on GPU, is characterized in that, comprises the steps:
S1: build GPU programmed environment;
S2: calculate the sight line that connects observation point and impact point;
S3: write data to GPU;
S4: every some intervisibility situation on parallel computation sight line line segment;
S5: synchronous point is set;
S6: walk abreast and judge intervisibility result;
S7: sense data is to CPU.
2. the intervisibility method for parallel processing based on GPU according to claim 1, it is characterized in that, described GPU programmed environment comprises hardware environment and software environment, and wherein hardware environment comprises CPU, supports the display chip of CUDA framework and connects the pci bus of CPU and display chip; Software environment comprises C/C++ compiler and CUDA.
3. the intervisibility method for parallel processing based on GPU according to claim 1, is characterized in that, described step S2 comprises following sub-step:
S2.1: read in the position of observation point, position, the terrain data of observation point and the terrain data of impact point of impact point;
S2.2: determine by the sight line line segment of observation point and impact point on CPU;
S2.3: the position of observation point and impact point is converted to geocentric coordinate system from geographic coordinate system;
S2.4: calculate the sight line line segment between observation point and impact point under geocentric coordinate system.
4. the intervisibility method for parallel processing based on GPU according to claim 3, is characterized in that, the terrain data of observation point and impact point respectively comprises longitude, latitude and height.
5. the intervisibility method for parallel processing based on GPU according to claim 1, is characterized in that, described step S3 comprises following sub-step:
S3.1: the video memory that all data is written to GPU from the internal memory of CPU;
S3.2: large and that remain unchanged data volume terrain data is put into texture cache from video memory and accelerate to read;
S3.3: constant buffer memory is put into in frequent observation station of accessing and impact point position in calculating and accelerate to read.
6. the intervisibility method for parallel processing based on GPU according to claim 1, is characterized in that, described step S4 comprises following sub-step:
In S4.1:GPU, a corresponding sight line line segment of thread block, distributes shared drive to preserve communication data;
S4.2: the thread mean allocation in each thread block is calculated the part discrete point in sight line;
S4.3: all threads are carried out identical discrete point intervisibility judgement simultaneously.
7. the intervisibility method for parallel processing based on GPU according to claim 6, it is characterized in that, described step S4.3 is: utilize interpolation computing method to be calculated the geocentric coordinate of corresponding discrete point by the geocentric coordinate of observation point and impact point, calculated the longitude of this discrete point by the geocentric coordinate of this discrete point, latitude and height, obtain the height of the landform of this discrete point position according to the longitude of this discrete point and latitude inquiry terrain data, by relatively judging whether the height of this discrete point is greater than the height of the landform of this discrete point position, and judged result is write to shared drive.
8. the intervisibility method for parallel processing based on GPU according to claim 1, it is characterized in that, described step S5 is: the thread in GPU is arranged to synchronous point, judge until the interior all threads of same thread block all complete every some intervisibility on sight line line segment the calculating that just continues next step.
9. the intervisibility method for parallel processing based on GPU according to claim 1, it is characterized in that, described step S6 is: the each thread block in GPU is by the intervisibility judged result in parallel traversal method shared drive, if the height of all discrete points is all greater than the height of the landform of this position in sight line, judge this sight line intervisibility, otherwise judge not intervisibility of this sight line, and the intervisibility result of this sight line is kept on the video memory of GPU.
10. the intervisibility method for parallel processing based on GPU according to claim 1, is characterized in that, described step S7 is: the intervisibility judged result of all sight lines that GPU is obtained writes back CPU internal memory, copies to CPU internal memory from the video memory of GPU by pci bus.
CN201410038204.4A 2014-01-26 2014-01-26 A kind of intervisibility method for parallel processing based on GPU Active CN103809937B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410038204.4A CN103809937B (en) 2014-01-26 2014-01-26 A kind of intervisibility method for parallel processing based on GPU

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410038204.4A CN103809937B (en) 2014-01-26 2014-01-26 A kind of intervisibility method for parallel processing based on GPU

Publications (2)

Publication Number Publication Date
CN103809937A true CN103809937A (en) 2014-05-21
CN103809937B CN103809937B (en) 2016-09-21

Family

ID=50706774

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410038204.4A Active CN103809937B (en) 2014-01-26 2014-01-26 A kind of intervisibility method for parallel processing based on GPU

Country Status (1)

Country Link
CN (1) CN103809937B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104121942A (en) * 2014-07-08 2014-10-29 哈尔滨工业大学 Automobile instrument automatic detection device based on graphic processing unit (GPU) and open CV image processing
CN110378834A (en) * 2019-07-24 2019-10-25 重庆大学 A kind of quick flux-vector splitting method based on isomerism parallel framework
CN110456319A (en) * 2019-08-29 2019-11-15 西安电子工程研究所 A kind of radar intervisibility calculation method based on SRTM
CN115794414A (en) * 2023-01-28 2023-03-14 中国人民解放军国防科技大学 Satellite-to-ground full-view analysis method, device and equipment based on parallel computing

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102662641A (en) * 2012-04-16 2012-09-12 浙江工业大学 Parallel acquisition method for seed distribution data based on CUDA
CN102708590A (en) * 2011-03-28 2012-10-03 上海日浦信息技术有限公司 Extensible general three-dimensional landscape simulation system
US20130091507A1 (en) * 2011-10-11 2013-04-11 Nec Laboratories America, Inc. Optimizing data warehousing applications for gpus using dynamic stream scheduling and dispatch of fused and split kernels
US20130215117A1 (en) * 2012-02-16 2013-08-22 Microsoft Corporation Rasterization of compute shaders
CN103336959A (en) * 2013-07-19 2013-10-02 西安电子科技大学 Vehicle detection method based on GPU (ground power unit) multi-core parallel acceleration

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102708590A (en) * 2011-03-28 2012-10-03 上海日浦信息技术有限公司 Extensible general three-dimensional landscape simulation system
US20130091507A1 (en) * 2011-10-11 2013-04-11 Nec Laboratories America, Inc. Optimizing data warehousing applications for gpus using dynamic stream scheduling and dispatch of fused and split kernels
US20130215117A1 (en) * 2012-02-16 2013-08-22 Microsoft Corporation Rasterization of compute shaders
CN102662641A (en) * 2012-04-16 2012-09-12 浙江工业大学 Parallel acquisition method for seed distribution data based on CUDA
CN103336959A (en) * 2013-07-19 2013-10-02 西安电子科技大学 Vehicle detection method based on GPU (ground power unit) multi-core parallel acceleration

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LIU BIN, YAO YIPING, TANG WENJIE, LU YANG: "Research on GPU-based Computation method for Line-Of-Sight Queries", 《IEEE CONFERENCE PUBLICATIONS》, 31 December 2012 (2012-12-31) *
王智杰: "地形通视性算法研究与设计", 《工程科技Ⅱ辑》, 28 February 2005 (2005-02-28), pages 032 - 3 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104121942A (en) * 2014-07-08 2014-10-29 哈尔滨工业大学 Automobile instrument automatic detection device based on graphic processing unit (GPU) and open CV image processing
CN110378834A (en) * 2019-07-24 2019-10-25 重庆大学 A kind of quick flux-vector splitting method based on isomerism parallel framework
CN110456319A (en) * 2019-08-29 2019-11-15 西安电子工程研究所 A kind of radar intervisibility calculation method based on SRTM
CN115794414A (en) * 2023-01-28 2023-03-14 中国人民解放军国防科技大学 Satellite-to-ground full-view analysis method, device and equipment based on parallel computing

Also Published As

Publication number Publication date
CN103809937B (en) 2016-09-21

Similar Documents

Publication Publication Date Title
JP7166383B2 (en) Method and apparatus for creating high-precision maps
Huang et al. Explorations of the implementation of a parallel IDW interpolation algorithm in a Linux cluster-based parallel GIS
Zhao et al. A parallel computing approach to viewshed analysis of large terrain data using graphics processing units
CN102446208B (en) Distributed algorithm for quickly establishing massive remote sensing image pyramid
Hu et al. Fast filtering of LiDAR point cloud in urban areas based on scan line segmentation and GPU acceleration
CN104036537A (en) Multiresolution Consistent Rasterization
CN103020620B (en) Based on the remote sensing image ortho-rectification method of CPU and GPU associated treatment
CN103809937A (en) Intervisibility parallel processing method based on GPU
Yashiro et al. A 1024-member ensemble data assimilation with 3.5-km mesh global weather simulations
CN107193923B (en) Method and system for quickly superposing vectors in two-dimensional geographic space
CN102880509A (en) Compute unified device architecture (CUDA) based grid digital elevation model (DEM) neighborhood analysis system and method
Huang et al. Using adaptively coupled models and high-performance computing for enabling the computability of dust storm forecasting
CN105931256A (en) CUDA (compute unified device architecture)-based large-format remote sensing image fast segmentation method
CN103439743A (en) Method for drawing seismic data profile graph
CN103761291A (en) Geographical raster data parallel reading-writing method based on request aggregation
CN106971369B (en) Data scheduling and distributing method based on GPU (graphics processing Unit) for terrain visual field analysis
CN106484532B (en) GPGPU parallel calculating method towards SPH fluid simulation
CN103400354B (en) Based on the remotely sensing image geometric correction method for parallel processing of OpenMP
CN111445503B (en) Pyramid mutual information image registration method based on parallel programming model on GPU cluster
CN117115200A (en) Hierarchical data organization for compact optical streaming
CN103675763B (en) A kind of based on hardware-accelerated vector quantization VTS radar video rendering method
CN106991638A (en) A kind of method of many granularity parallel optimizations based on sequential images Harris DOG feature extractions
Saupi Teri et al. GPU utilization in geoprocessing BIG Geodata: A review
CN107894992A (en) A kind of GIS dot buffer zones analysis method and system
CN110765130B (en) Ripley&#39;s K function-based spatio-temporal POI data point pattern analysis method in distributed environment

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant