• 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.

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

      Thumbnail
      View / Download
      545.8 Kb
      Author
      Kutluca, H.
      Kurç, T. M.
      Aykanat, Cevdet
      Date
      2000
      Source Title
      Journal of Supercomputing
      Print ISSN
      0920-8542
      Electronic ISSN
      1573-0484
      Publisher
      Springer
      Volume
      15
      Issue
      1
      Pages
      51 - 93
      Language
      English
      Type
      Article
      Item Usage Stats
      132
      views
      84
      downloads
      Abstract
      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.
      Keywords
      Algorithms
      Anti-Aliasing
      Computer Architecture
      Computer Systems Programming
      Data Storage Equipment
      Graph Theory
      Image Analysis
      Image Quality
      Response Time (Computer Systems)
      Sorting
      Chains-on-Chains Partitioning
      Direct Volume Rendering (DVR)
      Graph Partitioning
      Hilbert Space-Filling Curve
      Image-Space Decomposition Algorithms
      Jagged Decomposition
      Orthogonal Recursive Bisection (ORB)
      Rectilinear Decomposition (RD)
      Sort-First Parallelism
      Parallel Processing Systems
      Permalink
      http://hdl.handle.net/11693/25095
      Published Version (Please cite this version)
      http://dx.doi.org/10.1023/A:1008169609963
      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