An efficient Cartesian mesh generation strategy for complex geometries
From MaRDI portal
Publication:6120156
Recommendations
- Method to generate complex computational meshes efficiently
- Adaptively refined, parallelised sharp interface Cartesian grid method for three-dimensional moving boundary problems
- Adaptive Runge-Kutta discontinuous Galerkin method for complex geometry problems on Cartesian grid
- Towards a more efficient dynamic mesh adaptation methodology for continuum discretization in complex engineering problems
- Automatic generation of locally refined Cartesian meshes: data management and algorithms
Cites work
- A conservative and consistent implicit Cartesian cut-cell method for moving geometries with reduced spurious pressure oscillations
- A mass-conserving lattice Boltzmann method with dynamic grid refinement for immiscible two-phase flows
- A moving embedded boundary approach for the compressible Navier-Stokes equations in a block-structured adaptive refinement framework
- A novel ghost cell boundary model for the explicit moving particle simulation method in two dimensions
- A novel interpolation-free sharp-interface immersed boundary method
- A physically consistent discrete element method for arbitrary shapes using volume-interacting level sets
- A robust 2-refinement algorithm in octree or rhombic dodecahedral tree based all-hexahedral mesh generation
- A robust and scalable unfitted adaptive finite element framework for nonlinear solid mechanics
- A smoothed finite element method for octree-based polyhedral meshes with large number of hanging nodes and irregular elements
- A versatile sharp interface immersed boundary method for incompressible flows with complex boundaries
- Adaptively weighted numerical integration in the finite cell method
- Aeronautical CFD in the age of petaflops-scale computing: from unstructured to Cartesian meshes
- An Immersed Boundary Method Based on Parallel Adaptive Cartesian Grids for High Reynolds Number Turbulent Flow
- An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
- An immersed boundary method coupled with a dynamic overlapping-grids strategy
- An implicit Cartesian cut-cell method for incompressible viscous flows with complex geometries
- An octree pattern-based massively parallel PCG solver for elasto-static and dynamic problems
- An octree structured finite volume based solver
- An unstructured adaptive mesh refinement approach for computational fluid dynamics of reacting flows
- Coupling of turbulence wall models and immersed boundaries on Cartesian grids
- High order accurate and low dissipation method for unsteady compressible viscous flow computation on helicopter rotor in forward flight
- Immersed boundary and overset grid methods assessed for Stokes flow due to an oscillating sphere
- Nonlinear convergence in contact mechanics: immersed boundary finite volume
- Octree-based integration scheme with merged sub-cells for the finite cell method: application to non-linear problems in 3D
- Robust and efficient overset grid assembly for partitioned unstructured meshes
- Robust and scalable \(h\)-adaptive aggregated unfitted finite elements for interface elliptic problems
- Smart octrees: accurately integrating discontinuous functions in 3D
- The gradient and the Hessian of the distance between point and triangle in 3D
- Three-dimensional phase-field modeling of brittle fracture using an adaptive octree-based scaled boundary finite element approach
- Unsteady turbulent flow simulations on moving Cartesian grids using immersed boundary method and high-order scheme
This page was built for publication: An efficient Cartesian mesh generation strategy for complex geometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120156)
