[[abstract]]© 2004 Institute of Information Science Academia Sinica - The binary-swap (BS) and the parallel-pipelined (PP) methods are two well-known image compositing methods for sort-last parallel volume rendering systems. However, these two methods either restrict the number of processors to a power-of-two or require many communication steps to transform image data that results in high data communication overheads. In this paper, we present an efficient image compositing method, the rotate-tiling (RT) method, for sort-last parallel volume rendering systems on distributed memory multicomputers. According to the number of initial blocks of a partial image, the number of processors, the image sizes, and the characteristics of parallel machi...
In this paper, we present an efficient data compression scheme, the template run-length encoding (TR...
[[abstract]]In this paper, we present an efficient data compression scheme, the template run-length ...
The core advantage of sort last rendering is the theoretical nearly linear scalability in the number...
The binary-swap and the parallel-pipelined methods are two popular image composition methods for vol...
In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, as th...
Sort-last parallel rendering is a good rendering scheme on distributed memory multipro-cessors. This...
[[abstract]]In the sort-last-sparse parallel volume rendering system on distributed memory multicomp...
Journal ArticleExisting volume rendering methods, though capable of very effective visualizations, a...
In this work, to render at least 5123 voxel volumes in real-time, we have developed a sort-last para...
The only proven method for performing distributed-memory parallel rendering at large scales, tens of...
Parallel volume rendering offers a feasible solution to the large data visualization problem by dist...
In this paper, we consider a parallel rendering model that exploits the fundamental distinction betw...
Parallel volume rendering offers a feasible solution to the large data visualization problem by dist...
State of the art scientific simulations are currently working with data set sizes on the order of a ...
Several approaches have been proposed to visualize 3D volume data on multiprocessor systems in recen...
In this paper, we present an efficient data compression scheme, the template run-length encoding (TR...
[[abstract]]In this paper, we present an efficient data compression scheme, the template run-length ...
The core advantage of sort last rendering is the theoretical nearly linear scalability in the number...
The binary-swap and the parallel-pipelined methods are two popular image composition methods for vol...
In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, as th...
Sort-last parallel rendering is a good rendering scheme on distributed memory multipro-cessors. This...
[[abstract]]In the sort-last-sparse parallel volume rendering system on distributed memory multicomp...
Journal ArticleExisting volume rendering methods, though capable of very effective visualizations, a...
In this work, to render at least 5123 voxel volumes in real-time, we have developed a sort-last para...
The only proven method for performing distributed-memory parallel rendering at large scales, tens of...
Parallel volume rendering offers a feasible solution to the large data visualization problem by dist...
In this paper, we consider a parallel rendering model that exploits the fundamental distinction betw...
Parallel volume rendering offers a feasible solution to the large data visualization problem by dist...
State of the art scientific simulations are currently working with data set sizes on the order of a ...
Several approaches have been proposed to visualize 3D volume data on multiprocessor systems in recen...
In this paper, we present an efficient data compression scheme, the template run-length encoding (TR...
[[abstract]]In this paper, we present an efficient data compression scheme, the template run-length ...
The core advantage of sort last rendering is the theoretical nearly linear scalability in the number...