Rasterization Computing-Based Parallel Vector Polygon Overlay Analysis Algorithms Using OpenMP and MPI
11
TL;DR: Two types of parallel polygon overlay analysis algorithms are designed and implemented to determine the differences in efficiency between the RaPC algorithm and the Vatti algorithm under the open multi-processing and message passing interface parallel computing environments.
read more
Abstract: Vector polygon overlay is a complex type of a geo-spatial analysis algorithm used in geographical information system, which requires increasingly higher computational efficiency given the rapid growth of spatial data sets. Parallel computing has provided an effective approach to improve the computational efficiency and expand the processing scales of polygon overlay algorithms. Polygon overlay analysis algorithms that are based on traditional vector polygon clipping algorithms will experience significant efficiency decreases when handling overlap among polygons that have quantities of vertices. The discretization processing method-based rasterization-based polygon clipping algorithm (RaPC) algorithm exhibits higher efficiency for addressing clipping issues among such polygons. In this paper, we designed and implemented two types of parallel polygon overlay analysis algorithms to determine the differences in efficiency between the RaPC algorithm and the Vatti algorithm under the open multi-processing and message passing interface parallel computing environments. The results show that parallel polygon overlay analysis methods based on the RaPC algorithm present advantages for processing overlap among large data sets. The parallel algorithm based on the Vatti algorithm presents higher efficiency when handling overlap among small spatial data sets. The discretization process between two overlapped geometries of the RaPC algorithm provided a potential approach to solve the polygon overlay problem using a fine-grained parallelization method.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A universal parallel scheduling approach to polyline and polygon vector data buffer analysis on conventional GIS platforms
TL;DR: A universal parallel scheduling approach to buffer analysis on conventional GIS platforms is proposed, which accomplishes greater balanced decomposition of computational intensity for parallel buffer analysis and achieves near‐linear speedups.
17
Conservative phase-field method with a parallel and adaptive-mesh-refinement technique for interface tracking.
TL;DR: Various cases of the interface evolutions under steady flow fields indicate that the proposed numerical scheme can capture the interface with high accuracy, and the robustness of the numerical scheme is validated by simulating the Rayleigh-Taylor instability.
17
Decision support for hydraulic crane stabilization using combined loading and crane mat strength analysis
Ghulam Muhammad Ali,Asif Mansoor,Shuai Liu,Jacek Olearczyk,Ahmed Bouferguene,Mohamed Al-Hussein +5 more
TL;DR: A novel method is proposed in this manuscript to determine the pragmatic GBP profile directly under hydraulic crane mats using a combined loading approach.
7
Performance evaluation of spatial indexing to identify polygon intersection
Chen Zhou,Manchun Li +1 more
TL;DR: Compared with topology check, spatial indexing performs better with polygon overlay and R-tree–based algorithm is more efficient for experimental datasets when the ratio of polygons in actually intersecting pairs to total polygons is below a threshold.
1
Improving and evaluating boundary algebra filling for identifying polygon intersections
Chen Zhou,Manchun Li +1 more
TL;DR: Experimental results show that iBAF 2.0 outperforms R-tree when applied to topology verification; however, its performance is conditional for polygon overlay and area calculation between two layers.
1
References
Reentrant polygon clipping
TL;DR: A new family of clipping algorithms is described, able to clip polygons against irregular convex plane-faced volumes in three dimensions, removing the parts of the polygon which lie outside the volume.
633
Who launched what, when and why; trends in global land-cover observation capacity from civilian earth observation satellites
Alan Belward,Jon Olav Skøien +1 more
TL;DR: In this article, the authors present a compendium of satellites under civilian and/or commercial control with the potential to gather global land-cover observations and analyze the changes and shows how innovation, the need for secure data-supply, national pride, falling costs and technological advances may underpin the trends.
421
Hidden surface removal using polygon area sorting
Kevin Weiler,Peter Atherton +1 more
- 20 Jul 1977
TL;DR: In this paper, a polygon hidden surface and hidden line removal algorithm is presented, which recursively subdivides the image into polygon shaped windows until the depth order within the window is found.
Big Data challenges in building the Global Earth Observation System of Systems
TL;DR: This manuscript explores the impact of Big Data dimensionalities (commonly known as 'V' axes: volume, variety, velocity, veracity, visualization) on the Global Earth Observation System of Systems and particularly its common digital infrastructure (i.e. the GEOSS Common Infrastructure).
247