DWSI: AN APPROACH TO SOLVING THE POLYGON INTERSECTION-SPREADING PROBLEM WITH A PARALLEL UNION ALGORITHM AT THE FEATURE LAYER LEVEL
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Outros Autores: | , , , , |
Tipo de documento: | Artigo |
Idioma: | por |
Título da fonte: | Boletim de Ciências Geodésicas |
Texto Completo: | https://revistas.ufpr.br/bcg/article/view/35929 |
Resumo: | A dual-way seeds indexing (DWSI) method based on R-tree and the OpenGeospatial 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 ahigher 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. |
id |
UFPR-2_b7d8e3cfa435f03054fa727b31fd3df0 |
---|---|
oai_identifier_str |
oai:revistas.ufpr.br:article/35929 |
network_acronym_str |
UFPR-2 |
network_name_str |
Boletim de Ciências Geodésicas |
repository_id_str |
|
spelling |
DWSI: AN APPROACH TO SOLVING THE POLYGON INTERSECTION-SPREADING PROBLEM WITH A PARALLEL UNION ALGORITHM AT THE FEATURE LAYER LEVELGeociências; GeodésiaDual-way Seeds Indexing Method; Polygon Intersect-spreading; Parallel Union; Task PartitionA dual-way seeds indexing (DWSI) method based on R-tree and the OpenGeospatial 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 ahigher 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.Boletim de Ciências GeodésicasBulletin of Geodetic SciencesNational Key Technology R&D ProgramFAN, JUNFUZHOU, CHENGHUMA, TINGJI, MINZHOU, YUKEXU, TAO2014-03-31info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://revistas.ufpr.br/bcg/article/view/35929Boletim de Ciências Geodésicas; Vol 20, No 1 (2014)Bulletin of Geodetic Sciences; Vol 20, No 1 (2014)1982-21701413-4853reponame:Boletim de Ciências Geodésicasinstname:Universidade Federal do Paraná (UFPR)instacron:UFPRporhttps://revistas.ufpr.br/bcg/article/view/35929/22160info:eu-repo/semantics/openAccess2014-04-01T00:57:49Zoai:revistas.ufpr.br:article/35929Revistahttps://revistas.ufpr.br/bcgPUBhttps://revistas.ufpr.br/bcg/oaiqdalmolin@ufpr.br|| danielsantos@ufpr.br||qdalmolin@ufpr.br|| danielsantos@ufpr.br1982-21701413-4853opendoar:2014-04-01T00:57:49Boletim de Ciências Geodésicas - Universidade Federal do Paraná (UFPR)false |
dc.title.none.fl_str_mv |
DWSI: AN APPROACH TO SOLVING THE POLYGON INTERSECTION-SPREADING PROBLEM WITH A PARALLEL UNION ALGORITHM AT THE FEATURE LAYER LEVEL |
title |
DWSI: AN APPROACH TO SOLVING THE POLYGON INTERSECTION-SPREADING PROBLEM WITH A PARALLEL UNION ALGORITHM AT THE FEATURE LAYER LEVEL |
spellingShingle |
DWSI: AN APPROACH TO SOLVING THE POLYGON INTERSECTION-SPREADING PROBLEM WITH A PARALLEL UNION ALGORITHM AT THE FEATURE LAYER LEVEL FAN, JUNFU Geociências; Geodésia Dual-way Seeds Indexing Method; Polygon Intersect-spreading; Parallel Union; Task Partition |
title_short |
DWSI: AN APPROACH TO SOLVING THE POLYGON INTERSECTION-SPREADING PROBLEM WITH A PARALLEL UNION ALGORITHM AT THE FEATURE LAYER LEVEL |
title_full |
DWSI: AN APPROACH TO SOLVING THE POLYGON INTERSECTION-SPREADING PROBLEM WITH A PARALLEL UNION ALGORITHM AT THE FEATURE LAYER LEVEL |
title_fullStr |
DWSI: AN APPROACH TO SOLVING THE POLYGON INTERSECTION-SPREADING PROBLEM WITH A PARALLEL UNION ALGORITHM AT THE FEATURE LAYER LEVEL |
title_full_unstemmed |
DWSI: AN APPROACH TO SOLVING THE POLYGON INTERSECTION-SPREADING PROBLEM WITH A PARALLEL UNION ALGORITHM AT THE FEATURE LAYER LEVEL |
title_sort |
DWSI: AN APPROACH TO SOLVING THE POLYGON INTERSECTION-SPREADING PROBLEM WITH A PARALLEL UNION ALGORITHM AT THE FEATURE LAYER LEVEL |
author |
FAN, JUNFU |
author_facet |
FAN, JUNFU ZHOU, CHENGHU MA, TING JI, MIN ZHOU, YUKE XU, TAO |
author_role |
author |
author2 |
ZHOU, CHENGHU MA, TING JI, MIN ZHOU, YUKE XU, TAO |
author2_role |
author author author author author |
dc.contributor.none.fl_str_mv |
National Key Technology R&D Program |
dc.contributor.author.fl_str_mv |
FAN, JUNFU ZHOU, CHENGHU MA, TING JI, MIN ZHOU, YUKE XU, TAO |
dc.subject.por.fl_str_mv |
Geociências; Geodésia Dual-way Seeds Indexing Method; Polygon Intersect-spreading; Parallel Union; Task Partition |
topic |
Geociências; Geodésia Dual-way Seeds Indexing Method; Polygon Intersect-spreading; Parallel Union; Task Partition |
description |
A dual-way seeds indexing (DWSI) method based on R-tree and the OpenGeospatial 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 ahigher 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. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014-03-31 |
dc.type.none.fl_str_mv |
|
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://revistas.ufpr.br/bcg/article/view/35929 |
url |
https://revistas.ufpr.br/bcg/article/view/35929 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.relation.none.fl_str_mv |
https://revistas.ufpr.br/bcg/article/view/35929/22160 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Boletim de Ciências Geodésicas Bulletin of Geodetic Sciences |
publisher.none.fl_str_mv |
Boletim de Ciências Geodésicas Bulletin of Geodetic Sciences |
dc.source.none.fl_str_mv |
Boletim de Ciências Geodésicas; Vol 20, No 1 (2014) Bulletin of Geodetic Sciences; Vol 20, No 1 (2014) 1982-2170 1413-4853 reponame:Boletim de Ciências Geodésicas instname:Universidade Federal do Paraná (UFPR) instacron:UFPR |
instname_str |
Universidade Federal do Paraná (UFPR) |
instacron_str |
UFPR |
institution |
UFPR |
reponame_str |
Boletim de Ciências Geodésicas |
collection |
Boletim de Ciências Geodésicas |
repository.name.fl_str_mv |
Boletim de Ciências Geodésicas - Universidade Federal do Paraná (UFPR) |
repository.mail.fl_str_mv |
qdalmolin@ufpr.br|| danielsantos@ufpr.br||qdalmolin@ufpr.br|| danielsantos@ufpr.br |
_version_ |
1799771717705400320 |