• DocumentCode
    2633242
  • Title

    An optimal parallel algorithm for volume ray casting

  • Author

    Goel, Vineet ; Mukherjee, Amar

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA
  • fYear
    1995
  • fDate
    25-28 Apr 1995
  • Firstpage
    707
  • Lastpage
    711
  • Abstract
    Volume rendering by ray casting is a computationally expensive problem. For interactive volume visualization, rendering has to be done in real time (3D frames/sec). Since the typical 3D dataset size is at least 1283, the use of parallel processing is imperative. We present an O(log n) EREW algorithm for volume rendering using O(n3 ) processors which can be optimized to O(log3 n) time using O(n3/log3 n) processors. We have implemented our algorithm on MasPar MPl200. The implementation results show that a frame from 1233 data size is generated in about 3 seconds using 4096 processors
  • Keywords
    computational complexity; data visualisation; parallel algorithms; ray tracing; rendering (computer graphics); 3D dataset; MasPar MPl200; O(log n) EREW algorithm; computation time; frame; interactive volume visualization; optimal parallel algorithm; parallel processing; processors; volume ray casting; volume rendering; Casting; Parallel algorithms; Sampling methods; Tiles;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Symposium, 1995. Proceedings., 9th International
  • Conference_Location
    Santa Barbara, CA
  • Print_ISBN
    0-8186-7074-6
  • Type

    conf

  • DOI
    10.1109/IPPS.1995.395871
  • Filename
    395871
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2633242