Abstract This paper presents an improved ray casting algorithm, in order to solve the problems of powerful computing capacity and slow rendering velocity. In the course of ray casting volume rendering, an algorithm of ICT slice images original data field 2D maximum entropy threshold segmentation prior preprocessing is proposed. It is used to define the extent of threshold, and research the opti...

Volume rendering is a key technique in scientific visualization that lends itself to significant exploitable parallelism. The high computational demands of real-time volume rendering and continued technological advances in the area of VLSI give impetus to the development of special-purpose volume rendering architectures. This paper presents and characterizes three recently developed volume rend...

Recently, we proposed a new isosurface extraction algorithm that extracts portions of the isosurface in a viewdependent manner by ray casting and propagation. The algorithm casts rays through a volume to find visible active cells as seeds and then propagates their polygonal isosurface into the neighboring cells. Small pieces of the isosurface are generated by distance-limited propagation and jo...

We propose a fully automatic algorithm for view interpolation of a completely non-rigid dynamic event across both space and time. The algorithm operates by combining images captured across space to compute voxel models of the scene shape at each time instant, and images captured across time to compute the “scene flow” between the voxel models. The scene-flow is the non-rigid 3D motion of every ...

We consider the problem of ray shooting amidst spheres in 3-space: given n arbitrary (possibly intersecting) spheres in 3-space and any " > 0, we show how to preprocess the spheres in time O(n 3+"), into a data structure of size O(n 3+"), so that any ray-shooting query can be answered in time O(n "). Our result improves previous techniques (see 3, 5]), where roughly O(n 4) storage was required ...