An Efficient Parallel Algorithm for Polygons Overlay Analysis

Map overlay analysis is essential for geospatial analytics. Large scale spatial data pressing poses challenges for geospatial map overlay analytics. In this study, we propose an efficient parallel algorithm for polygons overlay analysis, including active-slave spatial index decomposition for interse...

Full description

Saved in:
Bibliographic Details
Published in:Applied sciences Vol. 9; no. 22; p. 4857
Main Authors: Zhou, Yuke, Wang, Shaohua, Guan, Yong
Format: Journal Article
Language:English
Published: Basel MDPI AG 13.11.2019
Subjects:
Algorithms
Communication
Decomposition
Methods
Outsourcing
Polygons
Spatial data
ISSN:2076-3417, 2076-3417
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Map overlay analysis is essential for geospatial analytics. Large scale spatial data pressing poses challenges for geospatial map overlay analytics. In this study, we propose an efficient parallel algorithm for polygons overlay analysis, including active-slave spatial index decomposition for intersection, multi-strategy Hilbert ordering decomposition, and parallel spatial union algorithm. Multi-strategy based spatial data decomposition mechanism is implemented, including parallel spatial data index, the Hilbert space-filling curve sort, and decomposition. The results of the experiments showed that the parallel algorithm for polygons overlay analysis achieves high efficiency.
AbstractList Map overlay analysis is essential for geospatial analytics. Large scale spatial data pressing poses challenges for geospatial map overlay analytics. In this study, we propose an efficient parallel algorithm for polygons overlay analysis, including active-slave spatial index decomposition for intersection, multi-strategy Hilbert ordering decomposition, and parallel spatial union algorithm. Multi-strategy based spatial data decomposition mechanism is implemented, including parallel spatial data index, the Hilbert space-filling curve sort, and decomposition. The results of the experiments showed that the parallel algorithm for polygons overlay analysis achieves high efficiency.
Author Guan, Yong
Zhou, Yuke
Wang, Shaohua
Author_xml – sequence: 1
  givenname: Yuke
  orcidid: 0000-0002-2559-0241
  surname: Zhou
  fullname: Zhou, Yuke
– sequence: 2
  givenname: Shaohua
  surname: Wang
  fullname: Wang, Shaohua
– sequence: 3
  givenname: Yong
  surname: Guan
  fullname: Guan, Yong
BookMark eNptkEtLAzEUhYNUsGo3_oKAO2E0z5nJwsVQ6gMK7ULXw20mqSnpZEymwvx7Ryoo4t2cu_jO4XDO0aQNrUHoipJbzhW5g65TjIlSFidoykiRZ1zQYvLrP0OzlHZkPEV5SckU3VctXljrtDNtj9cQwXvjceW3Ibr-bY9tiHgd_LANbcKrDxM9DLhqwQ_JpUt0asEnM_vWC_T6sHiZP2XL1ePzvFpmminZZ2KjKIiCas4YLTUHLiVjEsaujdropqRlIaFhwpJcgIScN5xoBmWjBc-l5Rfo-pjbxfB-MKmvd-EQxxKpZlJQzpTI-UjdHCkdQ0rR2LqLbg9xqCmpvxaqfxYaYfIH1q6H3oW2j-D8f5ZP9Rto5w
CitedBy_id crossref_primary_10_3390_a18030147
crossref_primary_10_3390_su15032442
crossref_primary_10_3390_app10113847
crossref_primary_10_3390_ijgi10070489
Cites_doi 10.3390/ijgi8070290
10.1016/j.cageo.2006.08.009
10.1016/j.compenvurbsys.2016.10.010
10.1109/IPDPSW.2013.254
10.1080/13658810210149443
10.1145/354756.354820
10.1007/s11806-009-0110-7
10.1109/ICDEW.2015.7129541
10.1109/IPDPSW.2012.180
10.1016/j.future.2018.10.034
10.1007/s00778-005-0001-y
10.1016/j.parco.2003.04.003
10.1145/2424321.2424323
10.1080/13658816.2018.1508689
10.1109/SC.Companion.2012.315
10.1007/3-540-52208-5_28
10.1109/38.204970
10.1007/11827405_45
10.1016/0010-4485(90)90055-H
10.1016/j.parco.2003.05.003
10.1109/CISIS.2007.16
10.1109/TKDE.2008.139
10.1109/ICCIS.2013.235
10.1007/s41651-017-0004-4
10.1109/ICSDM.2015.7298048
10.1007/s00453-001-0107-6
10.1145/602259.602266
10.1371/journal.pone.0105297
ContentType Journal Article
Copyright 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
ABUWG
AFKRA
AZQEC
BENPR
CCPQU
DWQXO
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
DOI 10.3390/app9224857
DatabaseName CrossRef
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials - QC
ProQuest Central
ProQuest One
ProQuest Central
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
DatabaseTitle CrossRef
Publicly Available Content Database
ProQuest Central
ProQuest One Academic Middle East (New)
ProQuest One Academic UKI Edition
ProQuest Central Essentials
ProQuest Central Korea
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList CrossRef
Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: ProQuest Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
EISSN 2076-3417
ExternalDocumentID 10_3390_app9224857
GroupedDBID .4S
2XV
5VS
7XC
8CJ
8FE
8FG
8FH
AADQD
AAFWJ
AAYXX
ADBBV
ADMLS
AFFHD
AFKRA
AFPKN
AFZYC
ALMA_UNASSIGNED_HOLDINGS
APEBS
ARCSS
BCNDV
BENPR
CCPQU
CITATION
CZ9
D1I
D1J
D1K
GROUPED_DOAJ
IAO
IGS
K6-
K6V
KC.
KQ8
L6V
LK5
LK8
M7R
MODMG
M~E
OK1
P62
PHGZM
PHGZT
PIMPY
PROAC
TUS
ABUWG
AZQEC
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
ID FETCH-LOGICAL-c295t-4b91a471c32218c3a355225a248d9bcd81875ad24f064a5a63d30c2a8dc4365f3
IEDL.DBID BENPR
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000502570800134&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2076-3417
IngestDate Mon Jun 30 11:22:08 EDT 2025
Sat Nov 29 07:17:49 EST 2025
Tue Nov 18 20:41:49 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 22
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c295t-4b91a471c32218c3a355225a248d9bcd81875ad24f064a5a63d30c2a8dc4365f3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-2559-0241
OpenAccessLink https://www.proquest.com/docview/2541329463?pq-origsite=%requestingapplication%
PQID 2541329463
PQPubID 2032433
ParticipantIDs proquest_journals_2541329463
crossref_primary_10_3390_app9224857
crossref_citationtrail_10_3390_app9224857
PublicationCentury 2000
PublicationDate 2019-11-13
PublicationDateYYYYMMDD 2019-11-13
PublicationDate_xml – month: 11
  year: 2019
  text: 2019-11-13
  day: 13
PublicationDecade 2010
PublicationPlace Basel
PublicationPlace_xml – name: Basel
PublicationTitle Applied sciences
PublicationYear 2019
Publisher MDPI AG
Publisher_xml – name: MDPI AG
References Wang (ref_8) 2003; 29
ref_14
ref_36
Tanin (ref_35) 2007; 16
ref_12
ref_34
ref_11
ref_33
ref_32
ref_31
Mineter (ref_13) 2003; 17
Minasny (ref_21) 2007; 33
Zhou (ref_4) 2009; 12
ref_19
ref_16
ref_38
Zhu (ref_28) 2007; 62
Heitzler (ref_40) 2017; 1
ref_25
ref_24
Ching (ref_15) 1999; 15
ref_23
ref_22
Yang (ref_39) 2017; 61
Zhang (ref_30) 2006; 22
Kantere (ref_9) 2008; 21
Naylor (ref_18) 1990; 22
ref_1
Wang (ref_10) 1993; 13
ref_3
ref_2
ref_29
Peuquet (ref_20) 1984; 21
ref_27
Zhou (ref_7) 2018; 32
Wang (ref_37) 2019; 94
Papadopoulos (ref_17) 2003; 29
ref_5
Arge (ref_26) 2002; 33
ref_6
References_xml – ident: ref_2
  doi: 10.3390/ijgi8070290
– ident: ref_24
– volume: 33
  start-page: 383
  year: 2007
  ident: ref_21
  article-title: The variance quadtree algorithm: Use for spatial sampling design
  publication-title: Comput. Geosci.
  doi: 10.1016/j.cageo.2006.08.009
– volume: 61
  start-page: 120
  year: 2017
  ident: ref_39
  article-title: Utilizing cloud computing to address big geospatial data challenges
  publication-title: Comput. Environ. Urban Syst.
  doi: 10.1016/j.compenvurbsys.2016.10.010
– ident: ref_5
  doi: 10.1109/IPDPSW.2013.254
– volume: 17
  start-page: 203
  year: 2003
  ident: ref_13
  article-title: A software framework to create vector-topology in parallel gis operations
  publication-title: Int. J. Geogr. Inf. Sci.
  doi: 10.1080/13658810210149443
– ident: ref_29
  doi: 10.1145/354756.354820
– volume: 12
  start-page: 257
  year: 2009
  ident: ref_4
  article-title: A parallel line segment intersection strategy based on uniform grids
  publication-title: Geo Spat. Inf. Sci.
  doi: 10.1007/s11806-009-0110-7
– ident: ref_3
  doi: 10.1109/ICDEW.2015.7129541
– ident: ref_6
  doi: 10.1109/IPDPSW.2012.180
– volume: 94
  start-page: 160
  year: 2019
  ident: ref_37
  article-title: An integrated gis platform architecture for spatiotemporal big data
  publication-title: Future Gener. Comput. Syst.
  doi: 10.1016/j.future.2018.10.034
– volume: 16
  start-page: 165
  year: 2007
  ident: ref_35
  article-title: Using a distributed quadtree index in peer-to-peer networks
  publication-title: VLDB J.
  doi: 10.1007/s00778-005-0001-y
– volume: 21
  start-page: 66
  year: 1984
  ident: ref_20
  article-title: A conceptual framework and comparison of spatial data models
  publication-title: Cartogr. Int. J. Geogr. Inf. Geovis.
– volume: 29
  start-page: 1481
  year: 2003
  ident: ref_8
  article-title: A quadtree approach to domain decomposition for spatial interpolation in grid computing environments
  publication-title: Parallel Comput.
  doi: 10.1016/j.parco.2003.04.003
– ident: ref_14
– ident: ref_32
  doi: 10.1145/2424321.2424323
– volume: 32
  start-page: 2402
  year: 2018
  ident: ref_7
  article-title: A parallel method to accelerate spatial operations involving polygon intersections
  publication-title: Int. J. Geogr. Inf. Sci.
  doi: 10.1080/13658816.2018.1508689
– ident: ref_11
  doi: 10.1109/SC.Companion.2012.315
– ident: ref_19
  doi: 10.1007/3-540-52208-5_28
– volume: 13
  start-page: 74
  year: 1993
  ident: ref_10
  article-title: A parallel intersection algorithm for vector polygon overlay
  publication-title: IEEE Comput. Graphics Appl.
  doi: 10.1109/38.204970
– ident: ref_34
  doi: 10.1007/11827405_45
– volume: 22
  start-page: 250
  year: 1990
  ident: ref_18
  article-title: Binary space partitioning trees as an alternative representation of polytopes
  publication-title: Comput. Aided Des.
  doi: 10.1016/0010-4485(90)90055-H
– volume: 62
  start-page: 217
  year: 2007
  ident: ref_28
  article-title: An efficient 3d r-tree spatial index method for virtual geographic environments
  publication-title: ISPRS
– volume: 22
  start-page: 20
  year: 2006
  ident: ref_30
  article-title: A study on topological reconstruction of gis vector data based on grid index
  publication-title: Geogr. Geo Inf. Sci.
– volume: 29
  start-page: 1419
  year: 2003
  ident: ref_17
  article-title: Parallel bulk-loading of spatial data
  publication-title: Parallel Comput.
  doi: 10.1016/j.parco.2003.05.003
– ident: ref_31
– ident: ref_25
  doi: 10.1109/CISIS.2007.16
– ident: ref_33
– ident: ref_27
– ident: ref_12
– volume: 15
  start-page: 441
  year: 1999
  ident: ref_15
  article-title: Load balancing for the parallel map overlay-operation in the geographic information system
  publication-title: J. Inf. Sci. Eng.
– volume: 21
  start-page: 287
  year: 2008
  ident: ref_9
  article-title: Storing and indexing spatial data in p2p systems
  publication-title: IEEE Trans. Knowl. Data Eng.
  doi: 10.1109/TKDE.2008.139
– ident: ref_36
– ident: ref_16
  doi: 10.1109/ICCIS.2013.235
– ident: ref_22
– volume: 1
  start-page: 3
  year: 2017
  ident: ref_40
  article-title: Gpu-accelerated rendering methods to visually analyze large-scale disaster simulation data
  publication-title: J. Geovis. Spat. Anal.
  doi: 10.1007/s41651-017-0004-4
– ident: ref_1
  doi: 10.1109/ICSDM.2015.7298048
– volume: 33
  start-page: 104
  year: 2002
  ident: ref_26
  article-title: Efficient bulk operations on dynamic r-trees
  publication-title: Algorithmica
  doi: 10.1007/s00453-001-0107-6
– ident: ref_23
  doi: 10.1145/602259.602266
– ident: ref_38
  doi: 10.1371/journal.pone.0105297
SSID ssj0000913810
Score 2.1921034
Snippet Map overlay analysis is essential for geospatial analytics. Large scale spatial data pressing poses challenges for geospatial map overlay analytics. In this...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 4857
SubjectTerms Algorithms
Communication
Decomposition
Methods
Outsourcing
Polygons
Spatial data
Title An Efficient Parallel Algorithm for Polygons Overlay Analysis
URI https://www.proquest.com/docview/2541329463
Volume 9
WOSCitedRecordID wos000502570800134&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: DOA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: M~E
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: BENPR
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Publicly Available Content Database
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: PIMPY
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NT8IwFG8UPOhBBTWiaJroQQ6NbO1GdzJqIJooLkYNnpZ-bGiCgAxJ-O99HR1IYrx4XNa8Le_7Y_s9hE7B86k40QlhXGvCYu0Q4YuEeFyaIZ92ZAam83LXaLd5pxOEtuGW2s8qc5-YOWo9UKZHfg6FjNmJznx6MfwkZmuUma7aFRqrqGiQykDPi1fNdvg477IY1Evu1Ge4pBTqezMXDlyD49VYjkTLjjiLLq2t_77XNtq0eSW-nClCCa3E_TLa-IE2WEYla8cpPrNg07UdBPU_bmYwEhB9cChGZrcK0Ol14SHjtw8MSS0OB71pF9QTP0xM-2-KcyiTXfTcaj5d3xC7UoEoN_DGhMnAERCPFNixwxUVkG6ARQtgiA6k0hC-G57QLksgVRGe8KmmdeUKrhWjvpfQPVToD_rxPsJQGfpSenU3ppL5QgJlF0gz7scxT5iqoFrO3khZvHGz9qIXQd1hRBEtRFFBJ_OzwxnKxq-nqrkIImtpabTg_8Hftw_ROiQ7gfmP0KFVVBiPvuIjtKYm4_d0dGwV5ziryeEqvL0PX78B3YLP9w
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB60CupBrQ98u6CCHoLJ7iZNDkXEB5Y-zEFFT3Gzu6lCbbWtlf4pf6OzbWIVxJsHz1mGbObLNzP7-AZgF5lP6kQlFveVsrhWjiU8kViuH5tNPuXEAzGdm0qhVvNvb4NwDN6zuzDmWGXGiQOiVi1p1sgPsZAxPdG5x46eXyzTNcrsrmYtNIawKOv-G5ZsnWLpFP27R-n52dXJhZV2FbAkDdyuxePAEUjJEqHs-JIJjLgIakHxbYNYKoxgBVcoyhOM1sIVHlPMllT4SnLmuQlDu-MwwRHsdg4mwlI1vPtc1TEqm75jD3VQGQtssw8dUKMbVvge-b4T_yCanc_9t-8wD7Np3kyOh0DPw5huLsDMFzXFBcinPNUh-6mY9sEiFI-b5Gwgk4HRlYSibXrHoJ1GHSfVfXgimLSTsNXo1_H3I5c9s7zZJ5lUyxJc_8mkliHXbDX1ChCsfL04dm2qWcw9EaNliqa572ntJ1yuwkHmzkimeuqmrUcjwrrKuD4auX4Vdj7HPg9VRH4ctZG5PEqZpBON_L32--NtmLq4qlaiSqlWXodpTOwCc2fSYRuQ67Zf9SZMyl73sdPeSkFL4P6v8fEBGkUoPg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LSwMxEB60iujBR1V8VA2ooIel3SS73T0UUduiVOoiKt7WbJJVoba1rZX-NX-dk3ZXLYg3D543DMnOl_kyeXwDsIeRT-pYxRb3lLK4VrYlXBFbjheZQz5lR0MxnduLYr3u3d35wQS8p29hzLXKNCYOA7VqSbNHnsdExtRE5y7Lx8m1iKBcPWq_WKaClDlpTctpjCBS04M3TN-6pfMy-nqf0mrl-vTMSioMWJL6Ts_ikW8LDM8SYW17kglkXwS4oNhzP5IK2azoCEV5jMwtHOEyxQqSCk9JzlwnZmh3EqaKDJOeDEydVOrB1ecOj1Hc9OzCSBOVMb9gzqR9ajTEiuMsOE4CQ2arLvznf7II88l6mhyPJsASTOhmFua-qSxmYSmJX11ykIhsHy5D6bhJKkP5DGRdEoiOqSmDdhoPOKje4zPBxTwJWo3BA05Lctk3254Dkkq4rMDNnwxqFTLNVlOvAcGM2I0ip0A1i7grIrRM0TT3XK29mMt1OExdG8pEZ92U-2iEmG8ZGIRfMFiH3c-27ZG6yI-tcqn7wyTCdMMv32_8_nkHZhAU4cV5vbYJs7je881TSpvlINPrvOotmJb93lO3s53gl8D9X8PjA97zMNg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Efficient+Parallel+Algorithm+for+Polygons+Overlay+Analysis&rft.jtitle=Applied+sciences&rft.au=Zhou%2C+Yuke&rft.au=Wang%2C+Shaohua&rft.au=Guan%2C+Yong&rft.date=2019-11-13&rft.pub=MDPI+AG&rft.eissn=2076-3417&rft.volume=9&rft.issue=22&rft.spage=4857&rft_id=info:doi/10.3390%2Fapp9224857&rft.externalDBID=HAS_PDF_LINK
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2076-3417&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2076-3417&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2076-3417&client=summon