2024/12/02 by Ansar Calloo, M. Evans, Calloo, Ansar +9 · 3 citations
Computer Science · Engineering · #65F08 (Primary) #65N50 (Secondary) #Advanced Mathematical Modeling in Engineering #Advanced Numerical Methods in Computational Mathematics #FOS: Mathematics #Lattice Boltzmann Simulation Studies #Numerical Analysis (math.NA)
paper · pdf · doi:10.48550/arxiv.2412.01660
openalex publication_date 2024/12/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce a novel property of bounded Voronoi tessellations that enables cycle-free mesh sweeping algorithms. We prove that a topological sort of the dual graph of any Voronoi tessellation is feasible in any flow direction and dimension, allowing straightforward application to discontinuous Galerkin (DG) discretisations of first-order hyperbolic partial differential equations and the Boltzmann Transport Equation (BTE) without requiring flux-cycle corrections. We also present an efficient algorithm to perform the topological sort on the dual mesh nodes, ensuring a valid sweep ordering. This result expands the applicability of DG methods for transport problems on polytopal meshes by providing a robust framework for scalable, parallelised solutions. To illustrate its effectiveness, we conduct a series of computational experiments showcasing a DG scheme for BTE, demonstrating both computational efficiency and adaptability to complex geometries.