{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:06:27Z","timestamp":1767139587133,"version":"build-2238731810"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T00:00:00Z","timestamp":1718668800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T00:00:00Z","timestamp":1718668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Engineering with Computers"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00366-024-02008-9","type":"journal-article","created":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T01:01:55Z","timestamp":1718672515000},"page":"3829-3847","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generic volume transfer for distributed mesh dynamic repartitioning"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1580-5517","authenticated-orcid":false,"given":"Guillaume","family":"Damiand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7330-8116","authenticated-orcid":false,"given":"Fabrice","family":"Jaillet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1680-3986","authenticated-orcid":false,"given":"Vincent","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,18]]},"reference":[{"issue":"3","key":"2008_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00366-005-0009-3","volume":"21","author":"F Alauzet","year":"2006","unstructured":"Alauzet F, Li X, Seol Es, Shephard MS (2006) Parallel anisotropic 3D mesh adaptation by mesh modification. Eng Comput 21(3):247\u2013258","journal-title":"Eng Comput"},{"key":"2008_CR2","doi-asserted-by":"crossref","unstructured":"Amdahl GM (1967) Validity of the single processor approach to achieving large scale computing capabilities. AFIPS \u201967 (Spring). ACM. pp 483\u2013485","DOI":"10.1145\/1465482.1465560"},{"issue":"2","key":"2008_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2049673.2049678","volume":"38","author":"W Bangerth","year":"2012","unstructured":"Bangerth W, Burstedde C, Heister T, Kronbichler M (2012) Algorithms and data structures for massively parallel generic adaptive finite element codes. ACM Trans Math Softw 38(2):1\u201328","journal-title":"ACM Trans Math Softw"},{"key":"2008_CR4","doi-asserted-by":"crossref","unstructured":"Burstedde C, Ghattas O, Gurnis M, Stadler G, Tan E, Tu T, Wilcox LC, Zhong S (2008) Scalable Adaptive mantle convection simulation on petascale supercomputers. IEEE","DOI":"10.1109\/SC.2008.5214248"},{"key":"2008_CR5","unstructured":"Carsten B, Omar G, Michael G, Tobin I, Georg S, Tim W, Lucas CW (2010) Extreme-scale amr"},{"key":"2008_CR6","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1137\/100791634","volume":"33","author":"C Burstedde","year":"2011","unstructured":"Burstedde C, Wilcox LC, Ghattas O (2011) P4est: Scalable algorithms for parallel adaptive mesh refinement on forests of octrees. SIAM J Sci Comput 33:1103\u20131133","journal-title":"SIAM J Sci Comput"},{"issue":"C","key":"2008_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.cag.2015.05.015","volume":"51","author":"D Cabiddu","year":"2015","unstructured":"Cabiddu D, Attene M (2015) Large mesh simplification for distributed environments. Comput Graph 51(C):81\u201389","journal-title":"Comput Graph"},{"key":"2008_CR8","unstructured":"Campbell PM, Devine KD, Flaherty JE, Gervasio LG, Teresco JD (2003) Dynamic octree load balancing using space-filling curves. Technical report, Technical Report CS-03-01, Williams College Department of Computer Science"},{"key":"2008_CR9","unstructured":"Damiand G (2011) Combinatorial maps. In: CGAL User and Reference Manual. 3.9 edition http:\/\/www.cgal.org\/Pkg\/CombinatorialMaps"},{"issue":"7","key":"2008_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.3390\/a11070105","volume":"11","author":"G Damiand","year":"2018","unstructured":"Damiand G, Gonzalez-Lorenzo A, Zara F, Dupont F (2018) Distributed combinatorial maps for parallel mesh processing. Algorithms 11(7):105","journal-title":"Algorithms"},{"key":"2008_CR11","doi-asserted-by":"crossref","unstructured":"Dawes W, Harvey S, Fellows S, Eccles N, Jaeggi D, Kellar W (2009) A practical demonstration of scalable, parallel mesh generation","DOI":"10.2514\/6.2009-981"},{"key":"2008_CR12","doi-asserted-by":"publisher","DOI":"10.1201\/b17403","volume-title":"Combinatorial maps: efficient data structures for computer graphics and image processing","author":"G Damiand","year":"2014","unstructured":"Damiand G, Lienhardt P (2014) Combinatorial maps: efficient data structures for computer graphics and image processing. A K Peters\/CRC Press"},{"key":"2008_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cag.2022.06.008","volume":"106","author":"G Damiand","year":"2022","unstructured":"Damiand G, Nivoliers V (2022) Query-replace operations for topologically controlled 3d mesh editing. Comput Graph 106:187\u2013199","journal-title":"Comput Graph"},{"key":"2008_CR14","doi-asserted-by":"crossref","unstructured":"Diamond G, Smith CW, Shephard MS (2017) Dynamic load balancing of massively parallel unstructured meshes. In: Proceedings of the 8th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems, ScalA \u201917, New York, NY, USA. Association for Computing Machinery","DOI":"10.1145\/3148226.3148236"},{"key":"2008_CR15","doi-asserted-by":"crossref","unstructured":"Filgueira R, Atkinson M, Nu\u00f1ez A, Fern\u00e1ndez J (2012) An adaptive, scalable, and portable technique for speeding up mpi-based applications. In: Euro-Par 2012 Parallel Processing. Springer, Berlin Heidelberg, pp 729\u2013740","DOI":"10.1007\/978-3-642-32820-6_72"},{"issue":"2","key":"2008_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jpdc.1997.1412","volume":"47","author":"JE Flaherty","year":"1997","unstructured":"Flaherty JE, Loy RM, Shephard MS, Szymanski BK, Teresco JD, Ziantz LH (1997) Adaptive local refinement with octree load-balancing for the parallel solution of three-dimensional conservation laws. J Parallel Distrib Comput 47(2):139\u2013152","journal-title":"J Parallel Distrib Comput"},{"key":"2008_CR17","unstructured":"Holke J, Burstedde C, Knapp D, Dreyer L, Elsweijer S, \u00dcnl\u00fc V, Markert J, Lilikakis I, B\u00f6ing N, Ponnusamy P et al (2023) t8code v. 1.0-modular adaptive mesh refinement in the exascale era. In: SIAM International Meshing Roundtable Workshop 2023 (SIAM IMR 2023), Amsterdam, Netherlands"},{"issue":"2\u20134","key":"2008_CR18","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0045-7825(99)00241-8","volume":"184","author":"B Hendrickson","year":"2000","unstructured":"Hendrickson B, Devine K (2000) Dynamic load balancing in computational mechanics. Comput Methods Appl Mech Eng 184(2\u20134):485\u2013500","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"2","key":"2008_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0307-904X(00)00042-1","volume":"25","author":"B Hendrickson","year":"2000","unstructured":"Hendrickson B (2000) Load balancing fictions, falsehoods and fallacies. Appl Math Model 25(2):99\u2013108","journal-title":"Appl Math Model"},{"issue":"6","key":"2008_CR20","doi-asserted-by":"publisher","first-page":"C359","DOI":"10.1137\/20M1383033","volume":"43","author":"J Holke","year":"2021","unstructured":"Holke J, Knapp D, Burstedde C (2021) An optimized, parallel computation of the ghost layer for adaptive hybrid forest meshes. SIAM J Sci Comput 43(6):C359\u2013C385","journal-title":"SIAM J Sci Comput"},{"issue":"C","key":"2008_CR21","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.jcp.2018.04.039","volume":"368","author":"JJ Hasbestan","year":"2018","unstructured":"Hasbestan JJ, Senocak I (2018) Binarized-octree generation for cartesian adaptive mesh refinement around immersed geometries. J Comput Phys 368(C):179\u2013195","journal-title":"J Comput Phys"},{"issue":"4","key":"2008_CR22","doi-asserted-by":"publisher","first-page":"3399","DOI":"10.1007\/s00366-021-01330-w","volume":"38","author":"F Jaillet","year":"2022","unstructured":"Jaillet F, Lobos C (2022) Fast quadtree\/octree adaptive meshing and re-meshing with linear mixed elements. Eng Comput 38(4):3399\u20133416","journal-title":"Eng Comput"},{"key":"2008_CR23","doi-asserted-by":"publisher","first-page":"8981","DOI":"10.1016\/j.jcp.2010.08.023","volume":"229","author":"H Ji","year":"2010","unstructured":"Ji H, Lien FS, Yee E (2010) A new adaptive mesh refinement data structure with an application to detonation. J Comput Phys 229:8981\u20138993","journal-title":"J Comput Phys"},{"key":"2008_CR24","doi-asserted-by":"crossref","unstructured":"Kale LV, Krishnan S (1993) Charm++ a portable concurrent object oriented system based on c++. In: Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications, pp 91\u2013108","DOI":"10.1145\/167962.165874"},{"key":"2008_CR25","doi-asserted-by":"crossref","unstructured":"Luitjens J, Berzins M (2010) Improving the performance of uintah: A large-scale adaptive meshing computational framework. In: Int. Symp. on Parallel & Distributed Processing (IPDPS). IEEE. pp 1\u201310","DOI":"10.1109\/IPDPS.2010.5470437"},{"key":"2008_CR26","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00366-006-0039-5","volume":"22","author":"OS Lawlor","year":"2006","unstructured":"Lawlor OS, Chakravorty S, Wilmarth TL, Choudhury N, Dooley I, Zheng G, Kal\u00e9 LV (2006) Parfum: a parallel framework for unstructured meshes for scalable dynamic physics applications. Eng Comput 22:215\u2013235","journal-title":"Eng Comput"},{"issue":"3","key":"2008_CR27","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1142\/S0218195994000173","volume":"4","author":"P Lienhardt","year":"1994","unstructured":"Lienhardt P (1994) N-dimensional generalized combinatorial maps and cellular quasi-manifolds. Int J Comput Geom Appl 4(3):275\u2013324","journal-title":"Int J Comput Geom Appl"},{"key":"2008_CR28","doi-asserted-by":"crossref","unstructured":"Langer A, Lifflander J, Miller P, Pan K-C, Kale LV, Ricker P (2012) Scalable algorithms for distributed-memory adaptive mesh refinement. In: 24th Int. Symp. on Computer Architecture and High Performance Computing. IEEE. pp 100\u2013107","DOI":"10.1109\/SBAC-PAD.2012.48"},{"key":"2008_CR29","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.proeng.2015.10.122","volume":"124","author":"A Loseille","year":"2015","unstructured":"Loseille A, Menier V, Alauzet F (2015) Parallel generation of large-size adapted meshes. Procedia Eng 124:57\u201369","journal-title":"Procedia Eng"},{"issue":"2","key":"2008_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3494456","volume":"41","author":"M Livesu","year":"2021","unstructured":"Livesu M, Pitzalis L, Cherchi G (2021) Optimal dual schemes for adaptive grid based hexmeshing. ACM Trans Graph 41(2):1\u20134","journal-title":"ACM Trans Graph"},{"issue":"9","key":"2008_CR31","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1002\/nme.5987","volume":"117","author":"C Marot","year":"2019","unstructured":"Marot C, Pellerin J, Remacle J-F (2019) One machine, one minute, three billion tetrahedra. Int J Numer Methods Eng 117(9):967\u2013990","journal-title":"Int J Numer Methods Eng"},{"key":"2008_CR32","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.proeng.2017.09.807","volume":"203","author":"TT Nguyen","year":"2017","unstructured":"Nguyen TT, Dahl VA, B\u00e6rentzen JA (2017) Cache-mesh, a dynamics data structure for performance optimization. Procedia Eng 203:193\u2013205","journal-title":"Procedia Eng"},{"issue":"2","key":"2008_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3554920","volume":"42","author":"N Pietroni","year":"2022","unstructured":"Pietroni N, Campen M, Sheffer A, Cherchi G, Bommes D, Gao X, Scateni R, Ledoux F, Remacle J, Livesu M (2022) Hex-mesh generation and processing: a survey. ACM Trans Graph 42(2):1\u201344","journal-title":"ACM Trans Graph"},{"key":"2008_CR34","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1137\/090747774","volume":"32","author":"RS Sampath","year":"2010","unstructured":"Sampath RS, Biros G (2010) A parallel geometric multigrid method for finite elements on octree meshes. SIAM J Sci Comput 32:1361\u20131392","journal-title":"SIAM J Sci Comput"},{"key":"2008_CR35","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s00366-006-0048-4","volume":"22","author":"E Seegyoung Seol","year":"2006","unstructured":"Seegyoung Seol E, Shephard Mark S (2006) Efficient distributed mesh data structure for parallel automated adaptive analysis. Eng Comput 22:197\u2013213","journal-title":"Eng Comput"},{"key":"2008_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.gmod.2020.101084","volume":"111","author":"J Tang","year":"2020","unstructured":"Tang J, Cui P, Li B, Zhang Y, Si H (2020) Parallel hybrid mesh adaptation by refinement and coarsening. Graph Models 111:101084","journal-title":"Graph Models"},{"issue":"1","key":"2008_CR37","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/MCG.1985.276271","volume":"5","author":"K Weiler","year":"1985","unstructured":"Weiler K (1985) Edge-based data structures for solid modelling in curved-surface environments. Comput Graph Appl 5(1):21\u201340","journal-title":"Comput Graph Appl"}],"updated-by":[{"DOI":"10.1007\/s00366-024-02052-5","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T00:00:00Z","timestamp":1725408000000}}],"container-title":["Engineering with Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-024-02008-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00366-024-02008-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-024-02008-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T11:25:13Z","timestamp":1733225113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00366-024-02008-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,18]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2008"],"URL":"https:\/\/doi.org\/10.1007\/s00366-024-02008-9","relation":{},"ISSN":["0177-0667","1435-5663"],"issn-type":[{"value":"0177-0667","type":"print"},{"value":"1435-5663","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,18]]},"assertion":[{"value":"7 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00366-024-02052-5","URL":"https:\/\/doi.org\/10.1007\/s00366-024-02052-5","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}