Comparison of two image-space subdivision algorithms for direct volume rendering on distributed-memory multicomputers

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage512en_US
dc.citation.spage503en_US
dc.contributor.authorTanin, Egemenen_US
dc.contributor.authorKurç, Tahsin M.en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.contributor.authorÖzgüç, Bülenten_US
dc.coverage.spatialLyngby, Denmark
dc.date.accessioned2016-02-08T12:00:44Z
dc.date.available2016-02-08T12:00:44Z
dc.date.issued1995-08en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionDate of Conference: 21-24 August, 1995
dc.descriptionConference name: International Workshop on Applied Parallel Computing PARA 1995: Applied Parallel Computing Computations in Physics, Chemistry and Engineering Science
dc.description.abstractDirect Volume Rendering (DVR) is a powerful technique for visualizing volumetric data sets. However, it involves intensive computations. In addition, most of the volumetric data sets consist of large number of 3D sampling points. Therefore, visualization of such data sets also requires large computer memory space. Hence, DVR is a good candidate for parallelization on distributed-memory multicomputers. In this work, image-space parallelization of Raycasting based DVR for unstructured grids on distributed-memory multicomputers is presented and discussed. In order to visualize unstructured volumetric datasets where grid points of the dataset are irregularly distributed over the 3D space, the underlying algorithms should resolve the point location and view sort problems of the 3D grid points. In this paper, these problems are solved using a Scanline Z-buffer based algorithm. Two image space subdivision heuristics, namely horizontal and recursive rectangular subdivision heuristics, are utilized to distribute the computations evenly among the processors in the rendering phase. The horizontal subdivision algorithm divides the image space into horizontal bands composed of consecutive scanlines. In the recursive subdivision algorithm, the image space is divided into rectangular subregions recursively. The experimental performance evaluation of the horizontal and recursive subdivision algorithms on an IBM SP2 system are presented and discussed. © Springer-Verlag Berlin Heidelberg 1996.en_US
dc.identifier.doi10.1007/3-540-60902-4_53
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11693/27744
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttps://doi.org/10.1007/3-540-60902-4_53
dc.source.titleApplied Parallel Computing Computations in Physics, Chemistry and Engineering Science. Second International Workshop, PARA '95en_US
dc.subjectComputersen_US
dc.subjectData visualizationen_US
dc.subjectMemory architectureen_US
dc.subjectVolume renderingen_US
dc.subjectVolumetric analysisen_US
dc.subjectDirect volume renderingen_US
dc.subjectDistributed memory multicomputersen_US
dc.subjectExperimental performance evaluationsen_US
dc.subjectParallelizationsen_US
dc.subjectRecursive subdivisionen_US
dc.subjectSubdivision algorithmsen_US
dc.subjectUnstructured griden_US
dc.subjectVolumetric data setsen_US
dc.subjectAlgorithmsen_US
dc.titleComparison of two image-space subdivision algorithms for direct volume rendering on distributed-memory multicomputersen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Comparison of two image-space subdivision algorithms for direct volume rendering on distributed-memory multicomputers.pdf
Size:
587.85 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Computer Engineering