{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T21:19:02Z","timestamp":1764105542719,"version":"3.46.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T00:00:00Z","timestamp":1751068800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T00:00:00Z","timestamp":1751068800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE- AC05-76RL01830"],"award-info":[{"award-number":["DE- AC05-76RL01830"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CSSI: 1931524"],"award-info":[{"award-number":["CSSI: 1931524"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Engineering with Computers"],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Computational meshes, as a way to partition space, form the basis of much of PDE simulation technology, for instance for the finite element and finite volume discretization methods. In complex simulations, we are often driven to modify an input mesh, for example, to refine, coarsen, extrude, change cell types, or filter it. Mesh manipulation code can be voluminous, error-prone, spread over many special cases, and hard to understand and maintain by subsequent developers. We present a simple, table-driven paradigm for mesh transformation which can execute a large variety of transformations in a performant, parallel manner, along with experiments in the open source library PETSc which can be run by the reader.<\/jats:p>","DOI":"10.1007\/s00366-025-02175-3","type":"journal-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T22:53:49Z","timestamp":1751064829000},"page":"3451-3462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Transformations of computational meshes"],"prefix":"10.1007","volume":"41","author":[{"given":"Matthew G.","family":"Knepley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,28]]},"reference":[{"key":"2175_CR1","volume-title":"Combinatorial topology","author":"PS Aleksandrov","year":"1998","unstructured":"Aleksandrov PS (1998) Combinatorial topology, vol 3. Dover Publications, USA"},{"key":"2175_CR2","doi-asserted-by":"crossref","unstructured":"Balay S, Abhyankar S, Adams MF, Benson S, Brown J, Brune P, Buschelman K, Constantinescu E, Dalcin L, Dener A, Eijkhout V, Faibussowitsch J, Gropp WD, Hapla V, Isaac T, Jolivet P, Karpeev D, Kaushik D, Knepley MG, Kong F, Kruger S, May DA, McInnes LC, Mills RT, Mitchell L, Munson T, Roman JE, Rupp K, Sanan P, Sarich J, Smith BF, Zampini S, Zhang H, Zhang H, Zhang J (2024) PETSc\/TAO users manual. Tech. Rep. ANL-21\/39\u2013revision 3.21. Argonne National Laboratory, USA","DOI":"10.2172\/2337606"},{"key":"2175_CR3","unstructured":"Balay S, Abhyankar S, Adams MF, Benson S, Brown J, Brune P, Buschelman K, Constantinescu EM, Dalcin L, Dener A, Eijkhout V, Faibussowitsch J, Gropp WD, Hapla V, Isaac T, Jolivet P, Karpeev D, Kaushik D, Knepley MG, Kong F, Kruger S, May DA, McInnes LC, Mills RT, Mitchell L, Munson T, Roman JE, Rupp K, Sanan P, Sarich J, Smith BF, Zampini S, Zhang H, Zhang H, Zhang J (2024) PETSc web page. https:\/\/petsc.org\/"},{"key":"2175_CR4","doi-asserted-by":"publisher","DOI":"10.2172\/10176386","volume-title":"Cubit mesh generation environment, volume 1: users manual. Tech. rep","author":"TD Blacker","year":"1994","unstructured":"Blacker TD, Bohnhoff WJ, Edwards TL (1994) Cubit mesh generation environment, volume 1: users manual. Tech. rep. Sandia National Labs, Albuquerque, NM, USA"},{"key":"2175_CR5","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1137\/21M1464841","volume":"65","author":"L Chamoin","year":"2023","unstructured":"Chamoin L, Legoll F (2023) An introductory review on a posteriori error estimation in finite element computations. SIAM Rev 65:963\u20131028","journal-title":"SIAM Rev"},{"key":"2175_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph structure and monadic second-order logic: a language-theoretic approach","author":"B Courcelle","year":"2012","unstructured":"Courcelle B, Engelfriet J (2012) Graph structure and monadic second-order logic: a language-theoretic approach, vol 138. Cambridge University Press, UK"},{"key":"2175_CR7","unstructured":"Denton BL (2022) Geometry aware mesh topologies, PhD thesis. University at Buffalo, Department of Mechanical and Aerospace Engineering, Buffalo, NY"},{"key":"2175_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/23M1613724","author":"DA Ham","year":"2024","unstructured":"Ham DA, Hapla V, Knepley MG, Mitchell L, Sagiyama K (2024) Efficient n-to-m checkpointing algorithm for finite element simulations. SIAM J Sci Comput. https:\/\/doi.org\/10.1137\/23M1613724","journal-title":"SIAM J Sci Comput"},{"key":"2175_CR9","doi-asserted-by":"publisher","first-page":"C127","DOI":"10.1137\/20M1332748","volume":"43","author":"V Hapla","year":"2021","unstructured":"Hapla V, Knepley MG, Afanasiev M, Boehm C, van Driel M, Krischer L, Fichtner A (2021) Fully parallel mesh I\/O using PETSc DMPlex with an application to waveform modeling. SIAM J Sci Comput 43:C127\u2013C153","journal-title":"SIAM J Sci Comput"},{"key":"2175_CR10","unstructured":"Isaac T, Knepley MG (2017) Support for non-conformal meshes in PETSc\u2019s DMPlex interface, ArXiv e-prints. arxiv:1508.02470"},{"key":"2175_CR11","unstructured":"Knepley MG, Karpeev DA (2005) Flexible representation of computational meshes. Technical report ANL\/MCS-P1295-1005, Argonne National Laboratory. ftp:\/\/info.mcs.anl.gov\/pub\/tech_reports\/reports\/P1295.pdf"},{"key":"2175_CR12","first-page":"215","volume":"17","author":"MG Knepley","year":"2009","unstructured":"Knepley MG, Karpeev DA (2009) Mesh algorithms for PDE with sieve I: mesh distribution. Sci Program 17:215\u2013230","journal-title":"Sci Program"},{"key":"2175_CR13","unstructured":"Knepley MG, Lange M, Gorman GJ (2017) Unstructured overlapping mesh distribution in parallel. ArXiv e-prints, arxiv:1506.06194"},{"key":"2175_CR14","doi-asserted-by":"publisher","first-page":"S143","DOI":"10.1137\/15M1026092","volume":"38","author":"M Lange","year":"2016","unstructured":"Lange M, Mitchell L, Knepley MG, Gorman GJ (2016) Efficient mesh management in firedrake using PETSc-DMPlex. SIAM J Sci Comput 38:S143\u2013S155","journal-title":"SIAM J Sci Comput"},{"key":"2175_CR15","doi-asserted-by":"crossref","unstructured":"M\u00e5lqvist A, Peterseim D (2020) Numerical homogenization by localized orthogonal decomposition. SIAM","DOI":"10.1137\/1.9781611976458"},{"key":"2175_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2020.109844","volume":"424","author":"M Parsani","year":"2021","unstructured":"Parsani M, Boukharfane R, Nolasco IR, Del Rey Fern\u00e1ndez D. C, Zampini S, Hadri B, Dalcin L (2021) High-order accurate entropy-stable discontinuous collocated Galerkin methods with the summation-by-parts property for compressible CFD frameworks: scalable SSDC algorithms and flow solver. J Comput Phys 424:109844","journal-title":"J Comput Phys"},{"key":"2175_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0168-9274(99)00022-7","volume":"32","author":"A Plaza","year":"2000","unstructured":"Plaza A, Carey GF (2000) Local refinement of simplicial grids based on the skeleton. Appl Numer Math 32:195\u2013218","journal-title":"Appl Numer Math"},{"key":"2175_CR18","doi-asserted-by":"crossref","unstructured":"Shapero D (2025) Linear-algebraic representation and transformation of unstructured meshes, pp\u00a0154\u2013166","DOI":"10.1137\/1.9781611978575.13"},{"key":"2175_CR19","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0014497","volume-title":"Applied computational geometry: towards geometric engineering","author":"JR Shewchuk","year":"1996","unstructured":"Shewchuk JR (1996) Triangle: engineering a 2D quality mesh generator and delaunay triangulator. In: Lin MC, Manocha D (eds) Applied computational geometry: towards geometric engineering, vol 1148. Lecture notes in computer science. Springer-Verlag, Berlin, pp 203\u2013222 (From the first ACM workshop on applied computational geometry)"},{"key":"2175_CR20","doi-asserted-by":"publisher","DOI":"10.1145\/2629697","volume":"41","author":"H Si","year":"2015","unstructured":"Si H (2015) TetGen, a Delaunay-based quality tetrahedral mesh generator. ACM Trans Math Softw 41:11","journal-title":"ACM Trans Math Softw"},{"key":"2175_CR21","doi-asserted-by":"crossref","unstructured":"Timalsina A, Knepley MG (2023) Tetrahedralization of a hexahedral mesh. In: SIAM international meshing roundtable workshop 2023","DOI":"10.1007\/978-3-031-40594-5_11"},{"key":"2175_CR22","unstructured":"Wikipedia (2015) Hasse diagram. http:\/\/en.wikipedia.org\/wiki\/Hasse_diagram"},{"key":"2175_CR23","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1109\/TPDS.2021.3084070","volume":"33","author":"J Zhang","year":"2022","unstructured":"Zhang J, Brown J, Balay S, Faibussowitsch J, Knepley M, Marin O, Mills RT, Munson T, Smith BF, Zampini S (2022) The PetscSF scalable communication layer. IEEE Trans Parallel Distrib Syst 33:842\u2013853","journal-title":"IEEE Trans Parallel Distrib Syst"}],"container-title":["Engineering with Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-025-02175-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00366-025-02175-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00366-025-02175-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T21:16:24Z","timestamp":1764105384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00366-025-02175-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,28]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2175"],"URL":"https:\/\/doi.org\/10.1007\/s00366-025-02175-3","relation":{},"ISSN":["0177-0667","1435-5663"],"issn-type":[{"type":"print","value":"0177-0667"},{"type":"electronic","value":"1435-5663"}],"subject":[],"published":{"date-parts":[[2025,6,28]]},"assertion":[{"value":"30 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}