Simulation of three-dimensional viscous flow in turbomachinery geometries using a solution-adaptive unstructured mesh methodology

This paper presents a numerical method for the simulation of flow in turbomachinery blade rows using a solution-adaptive mesh methodology. The fully three-dimensional, compressible, Reynolds-averaged Navier-Stokes equations with k-ε turbulence modeling (and low Reynolds number damping terms) are solved on an unstructured mesh formed from tetrahedral finite volumes. At stages in the solution, mesh refinement is carried out based on flagging cell faces with either a fractional variation of a chosen variable (like Mach number) greater than a given threshold or with a mean value of the chosen variable within a given range. Several solutions are presented, including that for the highly three-dimensional flow associated with the corner stall and secondary flow in a transonic compressor cascade, to demonstrate the potential of the new method.

Three-dimensional carbon nanowall structures

The authors report the growth of carbon nanowalls in freestanding, three-dimensional aggregates by microwave plasma-enhanced chemical vapor deposition. Carbon nanowalls extrude from plasma sites into three-dimensional space. The growth is catalyst-free and not limited by nucleating surfaces. The growth mechanism is discussed and compared with similar carbon nanomaterials. High surface area of as-grown carbon nanowalls indicates a potential for electrochemical applications. Field emission measurements show a low field turn-on and long-term stability. The results establish a scalable production method and possible applications using field emission or high surface area. © 2007 American Institute of Physics.

Computer generated hologram with geometric occlusion using GPU-accelerated depth buffer rasterization for three-dimensional display

We present a method of rapidly producing computer-generated holograms that exhibit geometric occlusion in the reconstructed image. Conceptually, a bundle of rays is shot from every hologram sample into the object volume.We use z buffering to find the nearest intersecting object point for every ray and add its complex field contribution to the corresponding hologram sample. Each hologram sample belongs to an independent operation, allowing us to exploit the parallel computing capability of modern programmable graphics processing units (GPUs). Unlike algorithms that use points or planar segments as the basis for constructing the hologram, our algorithm's complexity is dependent on fixed system parameters, such as the number of ray-casting operations, and can therefore handle complicated models more efficiently. The finite number of hologram pixels is, in effect, a windowing function, and from analyzing the Wigner distribution function of windowed free-space transfer function we find an upper limit on the cone angle of the ray bundle. Experimentally, we found that an angular sampling distance of 0:01' for a 2:66' cone angle produces acceptable reconstruction quality. © 2009 Optical Society of America.