family of volume rendering algorithms that reduces rendering times to one second. First we present a scanline-order volume rendering algorithm that exploits coherence in both the volume data and the image. We show that scanline-order algorithms are fundamentally more efficient than commonly-used ray

images and it is commonly believed that ray tracing is simply too costly to ever challenge rasterization-based algorithms for interactive use. However, there is hardly any scientific analysis that supports either point of view. In particular there is no evidence of where the crossover point might be

An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generated. Ray casting with spatial subdivision does well on criterion (a), but poorly on criterion (b). Traditional Z

and propositional model finding (and hence SAT, again). Several standard, and some not-so-standard, logical methods can therefore be used to solve these problems. By doing this we obtain a specification of the semantics of the common approaches. This synthetic treatment also allows algorithms and results from

An algorithm is proposed for accelerating intersection testing of a large collection of rays with a large scene database. The strategy utilizes bounding hierarchies over both the cast rays as well as the scene database. The ray hierarchy construction is based on line space concepts. Ecient

We propose a simple modification to the classical polygon rasterization pipeline that enables exact, efficient raycasting of bounded implicit surfaces without the use of a global spatial data structure or bounding hierarchy. Our algorithm requires two descriptions for each object: a (possibly non

inside) the data [4, 3]. Volume rendering also allows one to render surfaces, and, in fact, by changing the properties of the light emission and absorption, different lighting effects can be achieved [2]. The most common input data type is a regular (Cartesian) grid of voxels. Given a general scalar

This article describes a method for 3D visualization of medical data called ray casting. Some advantages over the standard rendering methods are showed and necessary techniques and tools with several improvements are discussed here.

, and size advantages over parallel processors. All architectures implement ray casting using parallel and pipelined hardware. We introduce a new metric that normalizes performance to compare these architectures. The architectures included in this survey are VOGUE, VIRIM, Array Based Ray Casting, EM

The GPUs pack high computation power and a restricted architecture into easily available hardware today. They are now used as computation co-processors and come with pro-gramming models that treat them as standard parallel ar-chitectures. Ray casting is an inherently parallel and highly compute