Image-space decomposition algorithms for sort-first parallel volume rendering of unstructured grids

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage93en_US
dc.citation.issueNumber1en_US
dc.citation.spage51en_US
dc.citation.volumeNumber15en_US
dc.contributor.authorKutluca, H.en_US
dc.contributor.authorKurç, T. M.en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.date.accessioned2016-02-08T10:39:07Z
dc.date.available2016-02-08T10:39:07Zen_US
dc.date.issued2000en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractTwelve 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.en_US
dc.identifier.doi10.1023/A:1008169609963en_US
dc.identifier.eissn1573-0484
dc.identifier.issn0920-8542
dc.identifier.urihttp://hdl.handle.net/11693/25095en_US
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttp://dx.doi.org/10.1023/A:1008169609963en_US
dc.source.titleJournal of Supercomputingen_US
dc.subjectAlgorithmsen_US
dc.subjectAnti-Aliasingen_US
dc.subjectComputer Architectureen_US
dc.subjectComputer Systems Programmingen_US
dc.subjectData Storage Equipmenten_US
dc.subjectGraph Theoryen_US
dc.subjectImage Analysisen_US
dc.subjectImage Qualityen_US
dc.subjectResponse Time (Computer Systems)en_US
dc.subjectSortingen_US
dc.subjectChains-on-Chains Partitioningen_US
dc.subjectDirect Volume Rendering (DVR)en_US
dc.subjectGraph Partitioningen_US
dc.subjectHilbert Space-Filling Curveen_US
dc.subjectImage-Space Decomposition Algorithmsen_US
dc.subjectJagged Decompositionen_US
dc.subjectOrthogonal Recursive Bisection (ORB)en_US
dc.subjectRectilinear Decomposition (RD)en_US
dc.subjectSort-First Parallelismen_US
dc.subjectParallel Processing Systemsen_US
dc.titleImage-space decomposition algorithms for sort-first parallel volume rendering of unstructured gridsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Image-Space Decomposition Algorithms for Sort-First Parallel Volume Rendering of Unstructured Grids.pdf
Size:
545.76 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Computer Engineering