{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:30:17Z","timestamp":1747153817967,"version":"3.40.5"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T00:00:00Z","timestamp":1566432000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T00:00:00Z","timestamp":1566432000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Earth Sci Inform"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s12145-019-00405-z","type":"journal-article","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T10:02:31Z","timestamp":1566468151000},"page":"581-597","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving and evaluating boundary algebra filling for identifying polygon intersections"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2707-2624","authenticated-orcid":false,"given":"Chen","family":"Zhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8689-9007","authenticated-orcid":false,"given":"Manchun","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,22]]},"reference":[{"key":"405_CR1","doi-asserted-by":"publisher","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pp 322\u2013331. \nhttps:\/\/doi.org\/10.1145\/93597.98741","DOI":"10.1145\/93597.98741"},{"issue":"2","key":"405_CR2","first-page":"61","volume":"14","author":"AV Belciu","year":"2010","unstructured":"Belciu AV, Olaru S (2010) Optimizing Spatial Databases. Inform Econ J 14(2):61\u201371","journal-title":"Inform Econ J"},{"key":"405_CR3","volume-title":"Introduction to geographic information systems","author":"KT Chang","year":"2008","unstructured":"Chang KT (2008) Introduction to geographic information systems. McGraw-Hill, New York"},{"key":"405_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational geometry","author":"M De Berg","year":"2000","unstructured":"De Berg M, Van Kreveld M, Overmars M, Schwarzkopf OC (2000) Computational geometry. Springer, Berlin"},{"key":"405_CR5","doi-asserted-by":"publisher","unstructured":"Dong H, Cheng ZL, Fang JY (2009) One rasterization approach algorithm for high performance map overlay. In: proceedings of 17th international conference on Geoinformatics. \nhttps:\/\/doi.org\/10.1109\/GEOINFORMATICS.2009.5293561","DOI":"10.1109\/GEOINFORMATICS.2009.5293561"},{"issue":"3","key":"405_CR6","doi-asserted-by":"publisher","first-page":"338","DOI":"10.11947\/j.AGCS.2015.20140017","volume":"44","author":"JF Fan","year":"2015","unstructured":"Fan JF, Kong WH, Ma T, Zhou CH, Ji M, Zhou YK (2015) RaPC: a rasterization-based polygon clipping algorithm and its error analysis. Acta Geod Carto Sinica 44(3):338\u2013345. \nhttps:\/\/doi.org\/10.11947\/j.AGCS.2015.20140017","journal-title":"Acta Geod Carto Sinica"},{"issue":"99","key":"405_CR7","doi-asserted-by":"publisher","first-page":"21427","DOI":"10.1109\/ACCESS.2018.2825452","volume":"6","author":"JF Fan","year":"2018","unstructured":"Fan JF, He HX, Hu TY, Li GH, Liu Q, Zhou YK (2018) Rasterization computing-based parallel vector polygon overlay analysis algorithms using OpenMP and MPI. IEEE Access 6(99):21427\u201321441. \nhttps:\/\/doi.org\/10.1109\/ACCESS.2018.2825452","journal-title":"IEEE Access"},{"issue":"1","key":"405_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/bf00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel RA, Bentley JL (1974) Quad trees a data structure for retrieval on composite keys. Acta Informatica 4(1):1\u20139. \nhttps:\/\/doi.org\/10.1007\/bf00288933","journal-title":"Acta Informatica"},{"key":"405_CR9","doi-asserted-by":"publisher","unstructured":"Gao Y, Wu B, Luo JX, Qiu HP (2017) GPU-based arbitrary polygon intersection area algorithm. In: Proceedings of 3rd international symposium on mechatronics and industrial informatics (ISMII 2017), pp 99\u2013105. \nhttps:\/\/doi.org\/10.12783\/dtetr\/ismii2017\/16652","DOI":"10.12783\/dtetr\/ismii2017\/16652"},{"issue":"10","key":"405_CR10","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1016\/j.cageo.2005.03.009","volume":"31","author":"IM Gombo\u0161","year":"2006","unstructured":"Gombo\u0161 IM, \u017dalik B (2006) Point-in-polygon tests for geometric buffers. Comput Geosci 31(10):1201\u20131212. \nhttps:\/\/doi.org\/10.1016\/j.cageo.2005.03.009","journal-title":"Comput Geosci"},{"issue":"2","key":"405_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/274363.274364","volume":"17","author":"G Greiner","year":"1998","unstructured":"Greiner G, Hormann K (1998) Efficient clipping of arbitrary polygons. ACM T Graphic 17(2):71\u201383. \nhttps:\/\/doi.org\/10.1145\/274363.274364","journal-title":"ACM T Graphic"},{"key":"405_CR12","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data","DOI":"10.1145\/602259.602266"},{"key":"405_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0925-7721(01)00012-8","volume":"20","author":"K Hormann","year":"2001","unstructured":"Hormann K, Agathos A (2001) The point in polygon problem for arbitrary polygons. Comput Geom 20:131\u2013144. \nhttps:\/\/doi.org\/10.1016\/S0925-7721(01)00012-8","journal-title":"Comput Geom"},{"issue":"1\u20134","key":"405_CR14","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1080\/16864360.2006.10738483","volume":"3","author":"DH Kim","year":"2006","unstructured":"Kim DH, Kim MJ (2006) An extension of polygon clipping to resolve degenerate cases. Comput Aided Design Appl 3(1\u20134):447\u2013456. \nhttps:\/\/doi.org\/10.1080\/16864360.2006.10738483","journal-title":"Comput Aided Design Appl"},{"issue":"5","key":"405_CR15","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.cageo.2006.08.008","volume":"33","author":"YK Liu","year":"2007","unstructured":"Liu YK, Wang XQ, Bao SZ, Gombo\u0161i M, \u017dalik B (2007) An algorithm for polygon clipping, and for determining polygon intersections and unions. Comput Geosci 33(5):589\u2013598. \nhttps:\/\/doi.org\/10.1016\/j.cageo.2006.08.008","journal-title":"Comput Geosci"},{"key":"405_CR16","volume-title":"Geographic information science and systems","author":"PA Longley","year":"2015","unstructured":"Longley PA, Goodchild MF, Maguire DJ, Rhind DW (2015) Geographic information science and systems. John Wiley & Sons, New York"},{"issue":"6","key":"405_CR17","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1016\/j.cageo.2008.08.009","volume":"35","author":"F Mart\u00ednez","year":"2009","unstructured":"Mart\u00ednez F, Rueda AJ, Feito FR (2009) A new algorithm for computing Boolean operations on polygons. Comput Geosci 35(6):1177\u20131185. \nhttps:\/\/doi.org\/10.1016\/j.cageo.2008.08.009","journal-title":"Comput Geosci"},{"key":"405_CR18","doi-asserted-by":"publisher","unstructured":"Puri S, Prasad SK (2014) Output-sensitive parallel algorithm for polygon clipping. In: Proceedings of IEEE International Conference on Parallel Processing, pp 241\u2013250. \nhttps:\/\/doi.org\/10.1109\/ICPP.2014.33","DOI":"10.1109\/ICPP.2014.33"},{"key":"405_CR19","doi-asserted-by":"publisher","unstructured":"Puri S, Prasad SK (2015) A parallel algorithm for clipping polygons with improved bounds and a distributed overlay processing system using MPI. In: Proceedings of IEEE\/ ACM International Symposium on Cluster, Cloud and Grid Computing, pp 576\u2013585. \nhttps:\/\/doi.org\/10.1109\/CCGrid.2015.43","DOI":"10.1109\/CCGrid.2015.43"},{"key":"405_CR20","doi-asserted-by":"publisher","unstructured":"Puri S, Agarwal D, He X, Prasad SK (2013) MapReduce algorithms for GIS polygonal overlay processing. In: Proceedings of IEEE 27th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), pp 1009\u20131016. \nhttps:\/\/doi.org\/10.1109\/IPDPSW.2013.254","DOI":"10.1109\/IPDPSW.2013.254"},{"key":"405_CR21","volume-title":"Theory, method and application of geographical information system","author":"FH Ren","year":"1989","unstructured":"Ren FH (1989) Theory, method and application of geographical information system. Peking University, Dissertation"},{"key":"405_CR22","unstructured":"Sellis T, Roussopoulos N, Faloutsos C (1987) The R+-tree: a dynamic index for multi-dimensional objects. In: proceedings of the 13th international conference on very large data. Bases:507\u2013518"},{"key":"405_CR23","unstructured":"Shi X (2012) System and Methods for Parallelizing Polygon Overlay Computation in Multiprocessing Environment. US 20120320087 A1"},{"issue":"7","key":"405_CR24","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/129902.129906","volume":"35","author":"BR Vatti","year":"1992","unstructured":"Vatti BR (1992) A generic solution to polygon clipping. Commun ACM 35(7):56\u201363. \nhttps:\/\/doi.org\/10.1145\/129902.129906","journal-title":"Commun ACM"},{"issue":"2","key":"405_CR25","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/38.204970","volume":"13","author":"F Wang","year":"1993","unstructured":"Wang F (1993) A parallel intersection algorithm for vector polygon overlay. IEEE Comput Graph 13(2):74\u201381. \nhttps:\/\/doi.org\/10.1109\/38.204970","journal-title":"IEEE Comput Graph"},{"issue":"3","key":"405_CR26","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1179\/000870410X12786821061413","volume":"47","author":"JC Wang","year":"2010","unstructured":"Wang JC, Cui C, Pu YX, Ma JS, Chen G (2010) A novel algorithm of buffer construction based on run-length encoding. Cartogr J 47(3):198\u2013210. \nhttps:\/\/doi.org\/10.1179\/000870410X12786821061413","journal-title":"Cartogr J"},{"issue":"2","key":"405_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1080\/17538947.2011.580860","volume":"5","author":"JC Wang","year":"2012","unstructured":"Wang JC, Cui C, Chen G, Pu YX, Ma JS (2012a) A new trapezoidal-mesh based data model for spatial operations. Int J Digit Earth 5(2):165\u2013183. \nhttps:\/\/doi.org\/10.1080\/17538947.2011.580860","journal-title":"Int J Digit Earth"},{"key":"405_CR28","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.14778\/2350229.2350268","volume":"5","author":"KB Wang","year":"2012","unstructured":"Wang KB, Huai Y, Lee RB, Wang FS, Zhang XD, Saltz JH (2012b) Accelerating pathology image data cross-comparison on CPU-GPU hybrid systems. PVLDB 5:1543\u20131554. \nhttps:\/\/doi.org\/10.14778\/2350229.2350268","journal-title":"PVLDB"},{"issue":"2","key":"405_CR29","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10586-015-0428-x","volume":"18","author":"Y Wang","year":"2015","unstructured":"Wang Y, Liu ZL, Liao HY (2015) Improving the performance of GIS polygon overlay computation with MapReduce for spatial big data processing. Cluster Comput 18(2):507\u2013516. \nhttps:\/\/doi.org\/10.1007\/s10586-015-0428-x","journal-title":"Cluster Comput"},{"key":"405_CR30","doi-asserted-by":"publisher","unstructured":"Weiler K, Atherton P (1977) Hidden surface removal using polygon area sorting. In: Proceedings of the 4th Annual Conference on Computer Graphics and Interactive Techniques, pp 214\u2013222. \nhttps:\/\/doi.org\/10.1145\/563858.563896","DOI":"10.1145\/563858.563896"},{"issue":"2","key":"405_CR31","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1009755931056","volume":"2","author":"XF Zhou","year":"1998","unstructured":"Zhou XF, Abel DJ, Truffet D (1998) Data partitioning for parallel spatial join processing. GeoInformatica 2(2):175\u2013204. \nhttps:\/\/doi.org\/10.1023\/A:1009755931056","journal-title":"GeoInformatica"},{"issue":"S1","key":"405_CR32","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s11430-007-5013-6","volume":"50","author":"CH Zhou","year":"2007","unstructured":"Zhou CH, Ou Y, Yang L, Qin B (2007) An equal area conversion model for rasterization of vector polygons. Sci China Ser D 50(S1):169\u2013175. \nhttps:\/\/doi.org\/10.1007\/s11430-007-5013-6","journal-title":"Sci China Ser D"},{"issue":"12","key":"405_CR33","doi-asserted-by":"publisher","first-page":"2402","DOI":"10.1080\/13658816.2018.1508689","volume":"32","author":"C Zhou","year":"2018","unstructured":"Zhou C, Chen ZJ, Li MC (2018) A parallel method to accelerate geospatial operations involving polygon intersections. Int J Geogr Inf Sci 32(12):2402\u20132426. \nhttps:\/\/doi.org\/10.1080\/13658816.2018.1508689","journal-title":"Int J Geogr Inf Sci"}],"container-title":["Earth Science Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12145-019-00405-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12145-019-00405-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12145-019-00405-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:20:50Z","timestamp":1597965650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12145-019-00405-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,22]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["405"],"URL":"https:\/\/doi.org\/10.1007\/s12145-019-00405-z","relation":{},"ISSN":["1865-0473","1865-0481"],"issn-type":[{"type":"print","value":"1865-0473"},{"type":"electronic","value":"1865-0481"}],"subject":[],"published":{"date-parts":[[2019,8,22]]},"assertion":[{"value":"23 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}