Learn More
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries and reduces the delays due to the latency of query results. We reuse the results of occlusion queries from the last frame in order to initiate and schedule the queries in the next(More)
We present an algorithm for visibility preprocessing of urban environments. The algorithm uses a subdivision of line space to analytically calculate a conservative potentially visible set for a given region in the scene. We present a detailed evaluation of our method including a comparison to another recently published visibility preprocessing algorithm. To(More)
In the scope of rendering complex models with high depth complexity, it is of great importance to design output-sensitive algorithms, i.e., algorithms with the time complexity proportional to the number of visible graphic primitives in the resulting image. In this paper an algorithm allowing efficient culling of the invisible portion of the rendered model(More)
We describe a novel data structure for representing light transport called ray map. The ray map extends the concept of photon maps: it stores not only photon impacts but the whole photon paths. We demonstrate the utility of ray maps for global illumination by eliminating boundary bias and reducing topological bias of density estimation in global(More)
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of temporal and spatial coherence of visibility. This is achieved by using adaptive visibility prediction and query batching. As a result of the new optimizations the number of issued(More)
We present a new technique for exact and output sensitive determination of visibility from a polygonal region in the plane. It uses hierarchical partitioning of line space, that provides comprehensive description of visibility for a set of occluders. To the best of our knowledge, it is the rst exact regional visibility algorithm suitable for visibility(More)
We present a technique that aims at exploiting temporal coherence of ray casted walkthroughs. Our goal is to reuse ray/object inter sections computed in the last frame of the walkthrough for acceleration of ray casting in the current frame. In particular we aim at eliminating the ray traversal and computing only a single ray/object intersection per pixel.(More)
The accurate display of high dynamic range images requires the application of complex tone mapping operators. These operators are computationally costly, which prevents their usage in interactive applications. We propose a general framework that delivers interactive performance to an important subclass of tone mapping operators, namely global tone mapping(More)
An orthogonal BSP (binary space partitioning) tree is a commonly used spatial subdivision data structure for ray tracing acceleration. While the construction of a BSP tree takes a relatively short time, the eeciency of a traversal algorithm signiicantly innuences the overall rendering time. We propose a new fast traversal algorithm based on statistical(More)