Computational geometry: an introduction
Computational geometry: an introduction
Raytracing irregular volume data
VVS '90 Proceedings of the 1990 workshop on Volume visualization
A polygonal approximation to direct scalar volume rendering
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Multiprocessor methods for computer graphics rendering
Multiprocessor methods for computer graphics rendering
Visibility-ordering meshed polyhedra
ACM Transactions on Graphics (TOG)
A multicomputer polygon rendering algorithm for interactive applications
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Scalable parallel volume raycasting for nonrectilinear computational grids
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
A parallel adaptive fast multipole method
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Interactive direct volume rendering of curvilinear and unstructured data
Interactive direct volume rendering of curvilinear and unstructured data
A Sorting Classification of Parallel Rendering
IEEE Computer Graphics and Applications
Scalable parallel direct volume rendering for nonrectilinear computational grids
Scalable parallel direct volume rendering for nonrectilinear computational grids
Rectilinear partitioning of irregular data parallel computations
Journal of Parallel and Distributed Computing
The sort-first rendering architecture for high-performance graphics
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
Optimal partitioning of sequences
Journal of Algorithms
Parallel volume ray-casting for unstructured-grid data on distributed-memory architectures
PRS '95 Proceedings of the IEEE symposium on Parallel rendering
Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves
IEEE Transactions on Parallel and Distributed Systems
Analysis of the clustering properties of Hilbert space-filling curve
Analysis of the clustering properties of Hilbert space-filling curve
A Comparison of Spatial Subdivision Algorithms for Sort-First Rendering
HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Partitioning an Array onto a Mesh of Processors
PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
On the Complexity of the Generalized Block Distribution
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Summed-area tables for texture mapping
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Fast optimal load balancing algorithms for 1D partitioning
Journal of Parallel and Distributed Computing
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
One-dimensional partitioning for heterogeneous systems: Theory and practice
Journal of Parallel and Distributed Computing
A Matrix Partitioning Interface to PaToH in MATLAB
Parallel Computing
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
SIAM Journal on Scientific Computing
Load-balancing spatially located computations using rectangular partitions
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Twelve adaptive image-space decomposition algorithms are presented for sort-first parallel direct volume rendering (DVR) of unstructured grids on distributed-memory architectures. The algorithms are presented under a novel taxonomy based on the dimension of the screen decomposition, the dimension of the workload arrays used in the decomposition, and the scheme used for workload-array creation and querying the workload of a region. For the 2D decomposition schemes using 2D workload arrays, a novel scheme is proposed to query the exact number of screen-space bounding boxes of the primitives in a screen region in constant time. A probe-based chains-on-chains partitioning algorithm is exploited for load balancing in optimal 1D decomposition and iterative 2D rectilinear decomposition (RD). A new probe-based optimal 2D jagged decomposition (OJD) is proposed which is much faster than the dynamic-programming based OJD scheme proposed in the literature. The summed-area table is successfully exploited to query the workload of a rectangular region in constant time in both OJD and RD schemes for the subdivision of general 2D workload arrays. Two orthogonal recursive bisection (ORB) variants are adapted to relax the straight-line division restriction in conventional ORB through using the medians-of-medians approach on regular mesh and quadtree superimposed on the screen. Two approaches based on the Hilbert space-filling curve and graph-partitioning are also proposed. An efficient primitive classification scheme is proposed for redistribution in 1D, and 2D rectilinear and jagged decompositions. The performance comparison of the decomposition algorithms is modeled by establishing appropriate quality measures for load-balancing, amount of primitive replication and parallel execution time. The experimental results on a Parsytec CC system using a set of benchmark volumetric datasets verify the validity of the proposed performance models. The performance evaluation of the decomposition algorithms is also carried out through the sort-first parallelization of an efficient DVR algorithm.