Multicore Parallelized Spatial Overlay Analysis Algorithm Using Vector Polygon Shape Complexity Index Optimization
As core algorithms of geographic computing, overlay analysis algorithms typically have computation-intensive and data-intensive characteristics. It is highly important to optimize overlay analysis algorithms by parallelizing the vector polygons after reasonable data division. To address the problem...
Main Authors: | Junfu Fan, Jiwei Zuo, Guangwei Sun, Zongwen Shi, Yu Gao, Yi Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-02-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/14/5/2006 |
Similar Items
-
High-Performance Overlay Analysis of Massive Geographic Polygons That Considers Shape Complexity in a Cloud Environment
by: Kang Zhao, et al.
Published: (2019-06-01) -
A Data Allocation Strategy for Geocomputation Based on Shape Complexity in A Cloud Environment Using Parallel Overlay Analysis of Polygons as an Example
by: Kang Zhao, et al.
Published: (2020-01-01) -
Comparative Study on the Effect of Shape Complexity on the Efficiency of Different Overlay Analysis Algorithms
by: Peng Zhang, et al.
Published: (2021-01-01) -
Parallel Load Balancing and Overlay Authentication System for Secure Industrial Network Communications
by: Lejun Ji, et al.
Published: (2020-11-01) -
Parallel Data Partitioning Algorithms for Optimization of Data-Parallel Applications on Modern Extreme-Scale Multicore Platforms for Performance and Energy
by: Ravi Reddy Manumachu, et al.
Published: (2018-01-01)