<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>3572</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>13</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>36</volume>
    <type>article</type>
    <publisherName>ACM</publisherName>
    <publisherPlace>New York, NY, USA</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Compressed Representation for Ray Tracing Parametric Surfaces</title>
    <abstract language="eng">Parametric surfaces are an essential modeling tool in computer aided design and movie production. Even though their use is well established in industry, generating ray-traced images adds significant cost in time and memory consumption. Ray tracing such surfaces is usually accomplished by subdividing the surfaces on-the-fly, or by conversion to a polygonal representation. However, on-the-fly subdivision is computationally very expensive, whereas polygonal meshes require large amounts of memory. This is a particular problem for parametric surfaces with displacement, where very fine tessellation is required to faithfully represent the shape. Hence, memory restrictions are the major challenge in production rendering. In this paper, we present a novel solution to this problem. We propose a compression scheme for a-priori Bounding Volume Hierarchies (BVHs) on parametric patches, that reduces the data required for the hierarchy by a factor of up to 48. We further propose an approximate evaluation method that does not require leaf geometry, yielding an overall reduction of memory consumption by a factor of 60 over regular BVHs on indexed face sets and by a factor of 16 over established state-of-the-art compression schemes. Alternatively, our compression can simply be applied to a standard BVH while keeping the leaf geometry, resulting in a compression rate of up to 2:1 over current methods. Although decompression generates additional costs during traversal, we can manage very complex scenes even on the memory restrictive GPU at competitive render times.</abstract>
    <parentTitle language="eng">ACM Transactions on Graphics</parentTitle>
    <identifier type="doi">10.1145/2953877</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>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">false</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Kai Selgrad</author>
    <author>Alexander Lier</author>
    <author>Magdalena Martinek</author>
    <author>Christoph Buchenau</author>
    <author>Michael Guthe</author>
    <author>Franziska Kranz</author>
    <author>Henry Schäfer</author>
    <author>Marc Stamminger</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Production Rendering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Subdivision Surfaces</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Displacement Mapping</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Ray Tracing</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>5264</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>121</pageFirst>
    <pageLast>130</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>242</volume>
    <type>conferenceobject</type>
    <publisherName>Gesellschaft für Informatik e.V.</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Sampling with Incremental MapReduce</title>
    <abstract language="eng">The goal of this paper is to increase the computation speed of MapReduce jobs by reducing the accuracy of the result. Often, the timely processing is more important than the precision of the result. Hadoop has no built-in functionality for such an approximation technique, so the user has to implement sampling techniques manually.&#13;
We introduce an automatic system for computing arithmetic approximations. The sampling is based on techniques from statistics and the extrapolation is done generically. This system is also extended by an incremental component which enables the reuse of already computed results to enlarge the sampling size. This can be used iteratively to further increase the sampling size and also the precision of the approximation. We present a transparent incremental sampling approach, so the developed components can be integrated in the Hadoop framework in a non-invasive manner.</abstract>
    <parentTitle language="eng">Datenbanksysteme für Business, Technologie und Web (BTW 2015) : Workshopband ; 02. - 03. März 2015 in Hamburg</parentTitle>
    <identifier type="url">https://btw-2015.informatik.uni-hamburg.de/res/proceedings/Workshops/DMS/Schaefer-Sampling_with_Incremental_.pdf</identifier>
    <enrichment key="opus.import.date">2022-08-20T07:06:56+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="OtherSeries">Lecture notes in informatics - proceedings ; 242</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Marc Schäfer</author>
    <author>Jürgen Schildgen</author>
    <author>Stefan Deßloch</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
  </doc>
</export-example>
