Efficient KD-tree based mesh redistribution for data remapping algorithms

DOI10.1007/978-3-031-40594-5_2MaRDI QIDQ7325638zbMATH OpenFDO

Authors Navamita Ray, Daniel Shevitz, Yipeng Li, Rao V. Garimella, Angela Herring, E. Kikinzon, K. Lipnikov, Hoby Rakotoarivelo, J. Velechovský

Publication date 8 September 2026

Full work available at URL https://doi.org/10.1007/978-3-031-40594-5_2

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• A parallel rendezvous algorithm for interpolation between multiple grids.
• An arbitrary Lagrangian-Eulerian computing method for all flow speeds
• Arbitrary Lagrangian-Eulerian methods for modeling high-speed compressible multimaterial flows
• Encyclopedia of parallel computing.
• Hybrid remap for multi-material ALE
• Multidimensional binary search trees used for associative searching
• Second-order sign-preserving conservative interpolation (remapping) on general grids

This page was built for publication: Efficient KD-tree based mesh redistribution for data remapping algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325638)