• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

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

      Thumbnail
      View / Download
      587.8 Kb
      Author
      Tanin, Egemen
      Kurç, Tahsin M.
      Aykanat, Cevdet
      Özgüç, Bülent
      Date
      1995-08
      Source Title
      Applied Parallel Computing Computations in Physics, Chemistry and Engineering Science. Second International Workshop, PARA '95
      Print ISSN
      0302-9743
      Publisher
      Springer
      Pages
      503 - 512
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      153
      views
      123
      downloads
      Abstract
      Direct 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.
      Keywords
      Computers
      Data visualization
      Memory architecture
      Volume rendering
      Volumetric analysis
      Direct volume rendering
      Distributed memory multicomputers
      Experimental performance evaluations
      Parallelizations
      Recursive subdivision
      Subdivision algorithms
      Unstructured grid
      Volumetric data sets
      Algorithms
      Permalink
      http://hdl.handle.net/11693/27744
      Published Version (Please cite this version)
      https://doi.org/10.1007/3-540-60902-4_53
      Collections
      • Department of Computer Engineering 1368
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy