DWSI: AN APPROACH TO SOLVING THE POLYGON INTERSECTION-SPREADING PROBLEM WITH A PARALLEL UNION ALGORITHM AT THE FEATURE LAYER LEVEL
DOI:
https://doi.org/10.5380/bcg.v20i1.35929Keywords:
Dual-way Seeds Indexing Method, Polygon Intersect-spreading, Parallel Union, Task PartitionAbstract
A dual-way seeds indexing (DWSI) method based on R-tree and the Open
Geospatial Consortium (OGC) simple feature model was proposed to solve the polygon intersection-spreading problem. The parallel polygon union algorithm based on the improved DWSI and the OpenMP parallel programming model was developed to validate the usability of the data partition method. The experimental results reveal that the improved DWSI method can implement a robust parallel task partition by overcoming the polygon intersection-spreading problem. The parallel union algorithm applied DWSI not only scaled up the data processing but alsospeeded up the computation compared with the serial proposal, and it showed a
higher computational efficiency with higher speedup benchmarks in the treatment of larger-scale dataset. Therefore, the improved DWSI can be a potential approach to parallelizing the vector data overlay algorithms based on the OGC simple data model at the feature layer level.
Downloads
Published
How to Cite
Issue
Section
License
Submission of an original manuscript to the Journal will be taken to mean that it represents original work not previously published, that is not being considered elsewhere for publication.
The BCG allows the author(s) to hold the copyright without restrictions and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
The BCG also allows the authors to retain publishing rights without restrictions.
