• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Computer Engineering
      • Dept. of Computer Engineering - Ph.D. / Sc.D.
      • View Item
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Computer Engineering
      • Dept. of Computer Engineering - Ph.D. / Sc.D.
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Spatial subdivision for parallel ray casting/tracing

      Thumbnail
      View / Download
      12.1 Mb
      Author(s)
      İşler, Veysi
      Advisor
      Aykanat, Cevdet
      Date
      1995
      Publisher
      Bilkent University
      Language
      English
      Type
      Thesis
      Item Usage Stats
      141
      views
      351
      downloads
      Abstract
      Ray casting/tracing has been extensively studied for a long time, since it is an elegant way of producing realistic images. However, it is a computationally intensive algorithm. In this study, a taxonomy of parallel ray casting/tracing algorithms is presented cind the primary parallel ray casting/tracing systems are discussed and criticized. This work mainly focuses on the utilization of spatial subdivision technique for ray casting/tracing on a distributed-memory MIMD parallel computer. In this research, the reason for the use of parallel computers is not only the processing power but also the large memory space provided by them. The spatial subdivision technique has been adapted to parallel ray casting/tracing to decompose a three-dimensional complex scene that may not fit into the local memory of a single processor. The decomposition method achieves an even distribution of scene objects while allowing to exploit graphical coherence. Additionally, the decomposition method produces three-dimensional volumes which are mapped inexpensively to the processors so that the objects within adjacent volumes are stored in the local memories of close processors to decrease interprocessor communication cost. Then, the developed decomposition and mapping methods have been parallelized efficiently to reduce the preprocessing overhead. Finally, a splitting plane concept (called “jaggy splitting plane”) has been proposed to accomplish full utilization of the memory space of processors. Jaggy splitting plane avoids the shared objects which are the major sources of inefficient utilization of both memory and processing power. The proposed parallel algorithms have been implemented on the Intel iPSC/2 hypercube multicomputer (distributed-memory MIMD).
      Keywords
      Ray casting
      Ray tracing
      Spatial subdivision
      Binary spatial partitioning (BSP)
      Splitting plane
      Hypercube topology
      Parallel processing
      Permalink
      http://hdl.handle.net/11693/18462
      Collections
      • Dept. of Computer Engineering - Ph.D. / Sc.D. 78
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      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 2976
      © Bilkent University - Library IT

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