Biological uid dynamics typically involves geometrically complicated structures which are often deforming in time. We give a brief overview of some approaches based on using xed Cartesian grids instead of attempting to use a grid which conforms to the boundary. Both nite-diierence and nite-volume methods are discussed, as well as a combined approach which has recently been used for computing in...

Large-eddy simulation (LES) has traditionally been restricted to fairly simple geometries. This paper discusses LES of reacting flows in geometries as complex as commercial gas turbine engine combustors. The incompressible algorithm developed by Mahesh et al. (J. Comput. Phys., 2004, 197, 215–240) is extended to the zero Mach number equations with heat release. Chemical reactions are modeled us...

Most occlusion culling algorithms select a subset of suitable occluder planes or geometries to exclude invisible objects from further visualization processing. Preferably these occluders are large and simple. For complex scenes it is worthwhile to generate virtual occluders to replace complex occluder geometries by simple polygonal structures. In urban scenes, the facade of buildings comprises ...

Fluorescence resonance energy transfer (FRET) can be utilized to gain low-resolution structural information by reporting on the proximity of molecules or measuring inter- and intramolecular distances. This method exploits the fact that the probability of the energy transfer is related to the separation between the fluorescent molecules. This relationship is well described for a single pair of f...

An alternative technique for shape morphing using a surface generating method using partial differential equations is outlined throughout this work. The boundaryvalue nature that is inherent to this surface generation technique together with its mathematical properties are hereby exploited for creating intermediate shapes between an initial shape and a final one. Four alternative shape morphing...

To simulate flows around solid obstacles of complex geometries, various immersed boundary methods had been developed. Their main advantage is the efficient implementation for stationary or moving solid boundaries of arbitrary complexity on fixed non-body conformal Cartesian grids. The Brinkman penalization method was proposed for incompressible viscous flows by penalizing the momentum equations...

We describe a method to solve the compressible time-dependent Euler equations using Cartesian grids for domains involving xed or moving geometries. We describe the concept of a mirror ow extrapolation of a given solution over a reeecting wall which may be curved or moving at a xed or varying speed. We use this mirror ow to develop a Cartesian grid method to treat the cells along a reeecting bou...

but with higher frequencies and amplitudes of the oscillating components), only a low accuracy can be achieved after an aaordable number of PCG iterations. The reason is that a strip-wise domain decomposition cannot handle large changes in non-constant coeecients in the lengthwise direction (see explanation at the end of section (5.1)). More general domain decompositions in the form of rectangu...

The lattice Boltzmann method has evolved over the past decade to a common technique in the field of computational fluid dynamics. The basic principle of cellular-automata allows an easy simulation of discrete surfaces and implementation of different boundary conditions. To meet the numerical requirements of continuous surfaces the enhanced Bouzidi bounce-back with interpolation was implemented....