An Efficient Method for Rendering Detailed Soft Shadow

In this paper, a new method is described for rendering convincing soft shadows from area light source at interactive frame rates. The method is based on the shadow map algorithm and it fully exploits the parallelism of the programmable graphics pipeline. In the method we sample the area light source using parallel linear segments and compute the light contribution of each segment using a completely new method which gives reasonable simulation for soft shadow generated by tiny scene object. We demonstrate that it can generate detailed soft shadow, while achieving the high frame rates. And our approach offers a number of benefits. E.g., it's easy to be adopted by the projects using shadowing map and there is no extra overhead while the complexity of the scene geometry increases.http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000238089300105&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701Computer Science, Interdisciplinary ApplicationsComputer Science, Theory & MethodsSCI(E)CPCI-S(ISTP)

Animating suspended particle explosions

This paper describes a method for animating suspended particle explosions. Rather than modeling the numerically troublesome, and largely invisible blast wave, the method uses a relatively stable incompressible fluid model to account for the motion of air and hot gases. The fluid's divergence field is adjusted directly to account for detonations and the generation and expansion of gaseous combustion products. Particles immersed in the fluid track the motion of particulate fuel and soot as they are advected by the fluid. Combustion is modeled using a simple but effective process governed by the particle and fluid systems. The method has enough flexibility to also approximate sprays of burning liquids. This paper includes several demonstrative examples showing air bursts, explosions near obstacles, confined explosions, and burning sprays. Because the method is based on components that allow large time integration steps, it only requires a few seconds of computation per frame for the examples shown. © 2003 ACM