{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:22Z","timestamp":1750307302656,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,4]]},"DOI":"10.1145\/1989493.1989498","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"33-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Parallelism in dynamic well-spaced point sets"],"prefix":"10.1145","author":[{"given":"Umut A.","family":"Acar","sequence":"first","affiliation":[{"name":"Max-Planck Institute for Software Systems, Kaiserslautern, Germany"}]},{"given":"Andrew","family":"Cotter","sequence":"additional","affiliation":[{"name":"Toyota Technological Institute at Chicago, Chicago, IL, USA"}]},{"given":"Benoit","family":"Hudson","sequence":"additional","affiliation":[{"name":"Autodesk, Inc., Montreal, PQ, Canada"}]},{"given":"Duru","family":"T\u00fcrkoglu","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1133993"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810959.1811011"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998196.1998254"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80059-5"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195999000303"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293035"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/355483.355487"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.163409"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(93)90009-U"},{"key":"e_1_3_2_1_13_1","volume-title":"Handbook on Data Structures and Applications","author":"Demetrescu C.","year":"2005","unstructured":"C. Demetrescu , I. Finocchi , and G. Italiano . Handbook on Data Structures and Applications , chapter 36: Dynamic Graphs. 2005 . C. Demetrescu, I. Finocchi, and G. Italiano. Handbook on Data Structures and Applications, chapter 36: Dynamic Graphs. 2005."},{"key":"e_1_3_2_1_14_1","first-page":"1117","volume-title":"J. Goodman and J. O'Rourke","author":"Guibas L.","year":"2004","unstructured":"L. Guibas . Modeling motion . In J. Goodman and J. O'Rourke , editors, Handbook of Discrete and Computational Geometry, pages 1117 -- 1134 . Chapman and Hall\/CRC , 2 nd edition, 2004 . L. Guibas. Modeling motion. In J. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, pages 1117--1134. Chapman and Hall\/CRC, 2nd edition, 2004.","edition":"2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542480"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-34958-7_20"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248435"},{"key":"e_1_3_2_1_18_1","volume-title":"Canadian Conference on Computational Geometry","author":"Hudson B.","year":"2008","unstructured":"B. Hudson and D. Turkoglu . An efficient query structure for mesh refinement . In Canadian Conference on Computational Geometry , 2008 . B. Hudson and D. Turkoglu. An efficient query structure for mesh refinement. In Canadian Conference on Computational Geometry, 2008."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90084-1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480907"},{"key":"e_1_3_2_1_21_1","first-page":"47","volume-title":"Refinement and Coarsening. In Fifth Intl. Meshing Roundtable","author":"Miller G. L.","year":"1996","unstructured":"G. L. Miller , D. Talmor , S.-H. Teng , N. Walkington , and H. Wang . Control Volume Meshes Using Sphere Packing: Generation , Refinement and Coarsening. In Fifth Intl. Meshing Roundtable , pages 47 -- 61 , 1996 . G. L. Miller, D. Talmor, S.-H. Teng, N. Walkington, and H. Wang. Control Volume Meshes Using Sphere Packing: Generation, Refinement and Coarsening. In Fifth Intl. Meshing Roundtable, pages 47--61, 1996."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/218013.218078"},{"key":"e_1_3_2_1_23_1","volume-title":"IBM","author":"Morton G. M.","year":"1966","unstructured":"G. M. Morton . A computer oriented geodetic data base; and a new technique in file sequencing. Technical report , IBM , Ottowa, CA , 1966 . G. M. Morton. A computer oriented geodetic data base; and a new technique in file sequencing. Technical report, IBM, Ottowa, CA, 1966."},{"key":"e_1_3_2_1_24_1","volume-title":"Computational Geometry: An Introduction Through Randomized Algorithms","author":"Mulmuley K.","year":"1994","unstructured":"K. Mulmuley . Computational Geometry: An Introduction Through Randomized Algorithms . Prentice Hall , 1994 . K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, 1994."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01228509"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185369"}],"event":{"name":"SPAA '11: 23rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"San Jose California USA","acronym":"SPAA '11"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989498","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989493.1989498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:56Z","timestamp":1750244396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":24,"alternative-id":["10.1145\/1989493.1989498","10.1145\/1989493"],"URL":"https:\/\/doi.org\/10.1145\/1989493.1989498","relation":{},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}