<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>3573</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>17</pageLast>
    <pageNumber/>
    <edition/>
    <issue>2</issue>
    <volume>1</volume>
    <type>conferenceobject</type>
    <publisherName>The Association for Computers in Mathematics and Science Teaching</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A High-Resolution Compression Scheme for Ray Tracing Subdivision Surfaces with Displacement</title>
    <abstract language="eng">Subdivision surfaces, especially with displacement, are one of the key modeling primitives used in high-quality rendering environments, such as, e.g., movie production. While their use easily maps to rasterization-based frameworks, they pose a significant challenge for ray tracing environments. This is due to the fact that incoherent access patterns require storing or caching fully tessellated and displaced meshes for efficient intersection computations. In this paper we use a two-tier hierarchy built on a scene's patches. It relies on compressed and quantized bounding volumes on the second tier to reduce the size of the BVH itself. Based on this acceleration structure, we propose a quantized, compact approximation for leaf nodes while being faithful to the underlying patch-geometry. We build on recent advances and present a system that shows competitive performance regarding run-time speed, which is close to full-resolution pre-tessellation methods as well as to previous compression approaches. Ultimately, we provide strong compression of up to a factor of 5: 1 compared to state-of-the-art methods while maintaining high geometrical fidelity surpassing similarly compact approximations and getting close to uncompressed geometry.</abstract>
    <parentTitle language="eng">Proceedings of the ACM on Computer Graphics and Interactive Techniques</parentTitle>
    <identifier type="doi">10.1145/3233308</identifier>
    <enrichment key="opus.import.date">2022-04-21T06:30:05+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Alexander Lier</author>
    <author>Magdalena Martinek</author>
    <author>Marc Stamminger</author>
    <author>Kai Selgrad</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Displacement Mapping</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>omputing methodologies</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Parametric curve and surface models</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Production Rendering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>ray tracing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Subdivision Surfaces</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
  </doc>
  <doc>
    <id>3549</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>4</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Association for Computing Machinery</publisherName>
    <publisherPlace>New York, NY, USA</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">CPU-Style SIMD Ray Traversal on GPUs</title>
    <abstract language="eng">In this paper we describe and evaluate an implementation of CPU-style SIMD ray traversal on the GPU. We show how spreading moderately wide BVHs (up to a branching factor of eight) across multiple threads in a warp can improve performance while not requiring expensive pre-processing. The presented ray-traversal method exhibits improved traversal performance especially for increasingly incoherent rays.</abstract>
    <parentTitle language="eng">Proceedings of the Conference on High-Performance Graphics</parentTitle>
    <identifier type="isbn">9781450358965</identifier>
    <identifier type="doi">10.1145/3231578.3231583</identifier>
    <enrichment key="opus.import.date">2022-04-21T06:30:05+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Alexander Lier</author>
    <author>Marc Stamminger</author>
    <author>Kai Selgrad</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>GPU</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>ray tracing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>SIMD</value>
    </subject>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othpublikationsherkunft" number="">Externe Publikationen</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
  </doc>
</export-example>
