{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:36:18Z","timestamp":1757313378376,"version":"3.41.2"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T00:00:00Z","timestamp":1692748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-sa\/4.0\/"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["CAHSI"],"award-info":[{"award-number":["CAHSI"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1901379, IIS-2237348, CNS-2031418, SES-1831615"],"award-info":[{"award-number":["IIS-1901379, IIS-2237348, CNS-2031418, SES-1831615"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,23]]},"DOI":"10.1145\/3609956.3609964","type":"proceedings-article","created":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T21:45:50Z","timestamp":1692913550000},"page":"85-95","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Scalable Overlay Operations over DCEL Polygon Layers"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7396-413X","authenticated-orcid":false,"given":"Andres","family":"Calderon-Romero","sequence":"first","affiliation":[{"name":"University of California, US"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5462-9451","authenticated-orcid":false,"given":"Vassilis J.","family":"Tsotras","sequence":"additional","affiliation":[{"name":"University of California, US"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6345-9730","authenticated-orcid":false,"given":"Amr","family":"Magdy","sequence":"additional","affiliation":[{"name":"University of California, US"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"619","article-title":"DCEL - A Polyhedral Database and Programming Environment","volume":"08","author":"Barequet G.","year":"1998","unstructured":"G. Barequet. 1998. DCEL - A Polyhedral Database and Programming Environment. IJCGA 08, 05n06 (1998), 619\u2013636.","journal-title":"IJCGA"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"N. Beckmann H. Kriegel R. Schneider and B. Seeger. 1990. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In ACM SIGMOD PODS. Association for Computing Machinery New York NY USA 322\u2013331.","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-010-0043-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1370949"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2010.11.003"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"D. Boltcheva J. Basselin C. Poull H. Barth\u00e9lemy and D. Sokolov. 2020. Topological-based roof modeling from 3D point clouds. In WSCG Vol.\u00a028. Union Agency Science Press CZ 301 00 Plzen 137\u2013146.","DOI":"10.24132\/JWSCG.2020.28.17"},{"key":"e_1_3_2_1_7_1","first-page":"27","article-title":"DD-Rtree: A dynamic distributed data structure for efficient data distribution among cluster nodes for spatial data mining algorithms. In IEEE Big Data. IEEE, 222 Rosewood Drive, Danvers","volume":"01923","author":"Challa J.","year":"2016","unstructured":"J. Challa, P. Goyal, S. Nikhil, A. Mangla, S. Balasubramaniam, and N. Goyal. 2016. DD-Rtree: A dynamic distributed data structure for efficient data distribution among cluster nodes for spatial data mining algorithms. In IEEE Big Data. IEEE, 222 Rosewood Drive, Danvers, MA 01923., 27\u201336.","journal-title":"MA"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(93)90001-M"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(75)90061-1"},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Quad Trees","volume":"4","author":"Finkel R.","year":"1974","unstructured":"R. Finkel and J. Bentley. 1974. Quad Trees: A Data Structure for Retrieval on Composite Keys.Acta Inf. 4 (1974), 1\u20139.","journal-title":"A Data Structure for Retrieval on Composite Keys.Acta Inf."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"E. Fogel D. Halperin and R. Wein. 2012. CGAL Arrangements and Their Applications. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-17283-0"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"W. Franklin S. Magalh\u00e3es and M. Andrade. 2018. Data Structures for Parallel Spatial Algorithms on Large Datasets. In ACM BigSpatial. ACM Seattle WA USA 16\u201319.","DOI":"10.1145\/3282834.3282839"},{"key":"e_1_3_2_1_13_1","unstructured":"W. Freiseisen. 1998. Colored DCEL for boolean operations in 2D."},{"volume-title":"R-Trees: A Dynamic Index Structure for Spatial Searching","author":"Guttman A.","key":"e_1_3_2_1_14_1","unstructured":"A. Guttman. 1984. R-Trees: A Dynamic Index Structure for Spatial Searching. In ACM SIGMOD ICMD. Association for Computing Machinery, New York, NY, United States, 47\u201357."},{"key":"e_1_3_2_1_15_1","unstructured":"R. Holmes. 2021. The DCEL Data Structure for 3D Graphics."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0534-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"S. Magalh\u00e3es M. Andrade W. Franklin and W. Li. 2015. Fast exact parallel map overlay using a two-level uniform grid. In ACM BigSpatial. Association for Computing Machinery New York NY USA 45\u201354.","DOI":"10.1145\/2835185.2835188"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/204865.204889"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90051-8"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/348.318586"},{"volume-title":"Art Gallery Theorems and Algorithms","author":"O\u2019Rourke J.","key":"e_1_3_2_1_21_1","unstructured":"J. O\u2019Rourke. 1987. Art Gallery Theorems and Algorithms. Oxford University Press, United States."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/4333"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"S. Puri D. Agarwal X. He and S. Prasad. 2013. MapReduce Algorithms for GIS Polygonal Overlay Processing. In IEEE IPDPS. IEEE Cambridge MA USA 1009\u20131016.","DOI":"10.1109\/IPDPSW.2013.254"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"S. Puri and S. Prasad. 2013. Efficient Parallel and Distributed Algorithms for GIS Polygonal Overlay Processing. In IEEE IPDPS. IEEE Computer Society USA 2238\u20132241.","DOI":"10.1109\/IPDPSW.2013.174"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"I. Sabek and M. Mokbel. 2017. On Spatial Joins in MapReduce. In ACM SIGSPATIAL. Association for Computing Machinery New York NY USA 1\u201310.","DOI":"10.1145\/3139958.3139967"},{"key":"e_1_3_2_1_26_1","unstructured":"H. Samet. 1990. The Design and Analysis of Spatial Data Structures. Wesley 75 Arlington Street Suite 300 Boston MA United States."}],"event":{"name":"SSTD '23: Symposium on Spatial and Temporal Data","acronym":"SSTD '23","location":"Calgary AB Canada"},"container-title":["Proceedings of the 18th International Symposium on Spatial and Temporal Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609956.3609964","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3609956.3609964","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3609956.3609964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T18:50:39Z","timestamp":1752087039000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609956.3609964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,23]]},"references-count":26,"alternative-id":["10.1145\/3609956.3609964","10.1145\/3609956"],"URL":"https:\/\/doi.org\/10.1145\/3609956.3609964","relation":{},"subject":[],"published":{"date-parts":[[2023,8,23]]},"assertion":[{"value":"2023-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}