• About
  • Policies
  • What is open access
  • 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.

      Compact tetrahedralization-based acceleration structures for ray tracing

      Thumbnail
      View / Download
      1.1 Mb
      Author(s)
      Aman, Aytek
      Demirci, Serkan
      Güdükbay, Uğur
      Date
      2022-10
      Source Title
      Journal of Visualization
      Print ISSN
      1343-8875
      Publisher
      Springer
      Volume
      25
      Pages
      1103 - 1115
      Language
      English
      Type
      Article
      Item Usage Stats
      4
      views
      1
      downloads
      Abstract
      We propose compact and efficient tetrahedral mesh representations to improve the ray-tracing performance. We reorder tetrahedral mesh data using a space-filling curve to improve cache locality. Most importantly, we propose efficient ray-traversal algorithms. We provide details of the regular ray-tracing operations on tetrahedral meshes and the GPU implementation of our traversal method. We demonstrate our findings through a set of comprehensive experiments. Our method outperforms existing tetrahedral mesh-based traversal methods and yields comparable results to the traversal methods based on the state-of-the-art acceleration structures such as k-dimensional (k-d) tree and Bounding Volume Hierarchy (BVH) in terms of speed. Storage-wise, our method uses less memory than its tetrahedral mesh-based counterparts, thus allowing larger scenes to be rendered on the GPU. Graphic Abstract: [Figure not available: see fulltext.] © 2022, The Visualization Society of Japan.
      Keywords
      Acceleration structure
      Bounding volume hierarchy (BVH)
      k-dimensional (k-d) tree
      Ray tracing
      Ray-surface intersection
      Tetrahedral mesh
      Permalink
      http://hdl.handle.net/11693/111612
      Published Version (Please cite this version)
      https://doi.org/10.1007/s12650-022-00842-x
      Collections
      • Department of Computer Engineering 1561
      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