Add to ORKGAbstruct-Visibility sorting is one of the key techniques in volume rendering of unstructured grids. The efficiency of sorting algorithm greatly affects the efficiency of volume rendering. Hardware-Assisted Visibility Sorting [1] (HAVS) is one of the most important volume rendering algorithms. This paper proposes an optimization algorithm of HAVS by keeping a sorted list which could decrease the comparing time in the fragment-level sorting process of k-buffer. The range of k is also analyzed by experiments. The results of experiment show that the proposed optimization algorithm obviously improves the efficiency of HAVS
In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, as th...
Abstract: We present a novel sorting algorithm, Vis-Sort, to sort 1D and 3D geometric elements. Give...
The core advantage of sort last rendering is the theoretical nearly linear scalability in the number...
Abstract—Harvesting the power of modern graphics hardware to solve the complex problem of real-time ...
A new voxelization algorithm is presented for fast and accurate volume rendering of unstructured gri...
Direct volume rendering based on projective methods works by projecting, in visibility order, the po...
Direct volume rendering based on projective methods works by projecting, in visibility order, the po...
Exact order-independent transparency (OIT) techniques capture all fragments during rasterization. Th...
In this paper, we propose a volume rendering method using grid computing for large-scale volume data...
This paper investigates three categories of algorithms for direct volume rendering of unstructured g...
Abstract − In this paper, we propose a volume rendering method using grid computing for large-scale ...
The demand for high quality and speed in graphical representations of 3D scenes is continuously incr...
We describe a sort-first algorithm for parallel direct volume rendering on GPUs, with the intent of ...
Twelve adaptive image-space decomposition algorithms are presented for sort-first parallel direct vo...
One of the most difficult problems in volume rendering hardware architectures is to provide an effic...
In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, as th...
Abstract: We present a novel sorting algorithm, Vis-Sort, to sort 1D and 3D geometric elements. Give...
The core advantage of sort last rendering is the theoretical nearly linear scalability in the number...
Abstract—Harvesting the power of modern graphics hardware to solve the complex problem of real-time ...
A new voxelization algorithm is presented for fast and accurate volume rendering of unstructured gri...
Direct volume rendering based on projective methods works by projecting, in visibility order, the po...
Direct volume rendering based on projective methods works by projecting, in visibility order, the po...
Exact order-independent transparency (OIT) techniques capture all fragments during rasterization. Th...
In this paper, we propose a volume rendering method using grid computing for large-scale volume data...
This paper investigates three categories of algorithms for direct volume rendering of unstructured g...
Abstract − In this paper, we propose a volume rendering method using grid computing for large-scale ...
The demand for high quality and speed in graphical representations of 3D scenes is continuously incr...
We describe a sort-first algorithm for parallel direct volume rendering on GPUs, with the intent of ...
Twelve adaptive image-space decomposition algorithms are presented for sort-first parallel direct vo...
One of the most difficult problems in volume rendering hardware architectures is to provide an effic...
In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, as th...
Abstract: We present a novel sorting algorithm, Vis-Sort, to sort 1D and 3D geometric elements. Give...
The core advantage of sort last rendering is the theoretical nearly linear scalability in the number...