Now showing items 101-120 of 524

    • Fast Parallel Construction of High-Quality Bounding Volume Hierarchies 

      Karras, Tero; Aila, Timo (ACM, 2013)
      We propose a new massively parallel algorithm for constructing high-quality bounding volume hierarchies (BVHs) for ray tracing. The algorithm is based on modifying an existing BVH to improve its quality, and executes in ...
    • SGRT: A Mobile GPU Architecture for Real-Time Ray Tracing 

      Lee, Won-Jong; Shin, Youngsam; Lee, Jaedon; Kim, Jin-Woo; Nah, Jae-Ho; Jung, Seokyoon; Lee, Shihwa; Park, Hyun-Sang; Han, Tack-Don (ACM, 2013)
      Recently, with the increasing demand for photorealistic graphics and the rapid advances in desktop CPUs/GPUs, real-time ray tracing has attracted considerable attention. Unfortunately, ray tracing in the current mobile ...
    • On Quality Metrics of Bounding Volume Hierarchies 

      Aila, Timo; Karras, Tero; Laine, Samuli (ACM, 2013)
      The surface area heuristic (SAH) is widely used as a predictor for ray tracing performance, and as a heuristic to guide the construction of spatial acceleration structures. We investigate how well SAH actually predicts ray ...
    • Megakernels Considered Harmful: Wavefront Path Tracing on GPUs 

      Laine, Samuli; Karras, Tero; Aila, Timo (ACM, 2013)
      When programming for GPUs, simply porting a large CPU program into an equally large GPU kernel is generally not a good approach. Due to SIMT execution model on GPUs, divergence in control flow carries substantial performance ...
    • Efficient BVH Construction via Approximate Agglomerative Clustering 

      Gu, Yan; He, Yong; Fatahalian, Kayvon; Blelloch, Guy (ACM, 2013)
      We introduce Approximate Agglomerative Clustering (AAC), an efficient, easily parallelizable algorithm for generating high-quality bounding volume hierarchies using agglomerative clustering. The main idea of AAC is to ...
    • Imperfect Voxelized Shadow Volumes 

      Wyman, Chris; Dai, Zeng (ACM, 2013)
      Voxelized shadow volumes [Wyman 2011] provide a discretized view-dependent representation of shadow volumes, but are limited to point or directional lights. We extend them to allow dynamic volumetric visibility from area ...
    • Lazy Incremental Computation for Efficient Scene Graph Rendering 

      Wörister, Michael; Steinlechner, Harald; Maierhofer, Stefan; Tobler, Robert F. (ACM, 2013)
      In order to provide a highly performant rendering system while maintaining a scene graph structure with a high level of abstraction, we introduce improved rendering caches, that can be updated incrementally without any ...
    • Real-time Local Displacement using Dynamic GPU Memory Management 

      Schäfer, Henry; Keinert, Benjamin; Stamminger, Marc (ACM, 2013)
      We propose a novel method for local displacement events in large scenes, such as scratches, footsteps, or sculpting operations. Deformations are stored as displacements for vertices generated by hardware tessellation. ...
    • Real-Time High-Resolution Sparse Voxelization with Application to Image-Based Modeling 

      Loop, Charles; Zhang, Cha; Zhang, Zhengyou (ACM, 2013)
      We present a system for real-time, high-resolution, sparse voxelization of an image-based surface model. Our approach consists of a coarse-to-fine voxel representation and a collection of parallel processing steps. Voxels ...
    • Screen-Space Far-Field Ambient Obscurance 

      Timonen, Ville (ACM, 2013)
      Ambient obscurance (AO) is an effective approximation of global illumination, and its screen-space (SSAO) versions that operate on depth buffers only are widely used in real-time applications. We present an SSAO method ...
    • Out-of-Core Construction of Sparse Voxel Octrees 

      Baert, Jeroen; Lagae, Ares; Dutre´, Philip (ACM, 2013)
      Voxel-based rendering has recently received significant attention due to its potential in the context of efficiently rendering massively large and highly detailed scenes. Unfortunately, few or no scenes are available in ...
    • Preface and Table of Contents 

      Kayvon Fatahalian and Christian Theobalt (ACM, 2013)
    • PixelPie: Maximal Poisson-disk Sampling with Rasterization 

      Ip, Cheuk Yiu; Yalc, M. Adil; Luebke, David; Varshney, Amitabh (ACM, 2013)
      We present PixelPie, a highly parallel geometric formulation of the Poisson-disk sampling problem on the graphics pipeline. Traditionally, generating a distribution by throwing darts and removing conflicts has been viewed ...
    • Theory and Analysis of Higher-Order Motion Blur Rasterization 

      Gribel, Carl Johan; Munkberg, Jacob; Hasselgren, Jon; Akenine-Möller, Tomas (ACM, 2013)
      A common assumption in motion blur rendering is that the triangle vertices move in straight lines. In this paper, we focus on scenarios where this assumption is no longer valid, such as motion due to fast rotation and other ...
    • Lossless Compression of Already Compressed Textures 

      Ström, Jacob; Wennersten, Per (ACM, 2011)
      Texture compression helps rendering by reducing the footprint in graphics memory, thus allowing for more textures, and by lowering the number of memory accesses between the graphics processor and memory, increasing performance ...
    • Primitive Processing and Advanced Shading Architecture for Embedded Space 

      Kazakov, Max; Ohbuchi, Eisaku (ACM, 2011)
      This paper presents a new graphics architecture enabling contentrich applications for the embedded space by extending hardware architecture in two main areas - geometry processing and configurable per-fragment shading. Our ...
    • Precision Selection for Energy-Effi cient Pixel Shaders 

      Pool, Jeff; Lastra, Anselmo; Singh, Montek (ACM, 2011)
      In this work, we seek to realize energy savings in modern pixel shaders by reducing the precision of their arithmetic. We explore three schemes for controlling this reduction. The first is a static analysis technique, which ...
    • Farthest-Point Optimized Point Sets with Maximized Minimum Distance 

      Schlömer, Thomas; Heck, Daniel; Deussen, Oliver (ACM, 2011)
      Efficient sampling often relies on irregular point sets that uniformly cover the sample space. We present a flexible and simple optimization strategy for such point sets. It is based on the idea of increasing the mutual ...
    • Rapid Simplifi cation of Multi-Attribute Meshes 

      Willmott, Andrew (ACM, 2011)
      We present a rapid simplification algorithm for meshes with multiple vertex attributes, targeted at rendering acceleration for realtime applications. Such meshes potentially feature normals, tangents, one or more texture ...
    • VoxelPipe: A Programmable Pipeline for 3D Voxelization 

      Pantaleoni, Jacopo (ACM, 2011)
      We present a highly exible and e cient software pipeline for programmable triangle voxelization. The pipeline, entirely written in CUDA, supports both fully conservative and thinvoxelizations, multiple boolean, oating ...