In this paper, we introduce a new representation – radiance transfer fields (RTF) – for rendering interreflections in dynamic scenes under low frequency illumination. The RTF describes the radiance transferred by an individual object to its surrounding space as a function of the incident radiance. An important property of RTF is its independence of the scene configuration, enabling interreflect...

By preserving the macro structure of the Data Encryption Standard (DES), but by allowing the user to choose 1. 16•48 independent key bits instead of generating them all using only 56 key bits, 2. arbitrary substitutions S1, ..., S8 and 3. arbitrary permutations IP and P, and 4. an arbitrary expanding permutation E, we obtain a very general and presumably much stronger cipher called generalized ...

A range-max query obtains the maximum over all selected cells of a data cube where the selection is speci ed by providing ranges of values for numeric dimensions. Our general approach to speeding up range-max queries is to precompute and store certain key information of the data cube. In [HAMS97], we gave a tree algorithm based on precomputed max over balanced hierarchical tree structures; a br...

This paper presents a real-time global illumination method for static scenes illuminated by arbitrary, dynamic light sources. The method consists of a preprocessing phase and a real-time rendering phase. The real-time rendering algorithm obtains the indirect illumination caused by the multiple scattering of the light from partial light paths that are precomputed and stored in the preprocessing ...

The reduced basis element method is a new approach for approximating the solution of problems described by partial differential equations. The method takes its roots in domain decomposition methods and reduced basis discretizations [8, 16, 17], and its applications extend to, for example, control and optimization problems. The basic idea is to first decompose the computational domain into a ser...

The most time consuming operation to verify a signature with the Elliptic Curve Digital Signature Algorithm is a multi-scalar multiplication with two scalars. Efficient methods for its computation are the Shamir method and the Interleave method, whereas the performance of those methods can be improved by using general base-2 representations of the scalars. In exchange for the speed-up, those re...

Proof: If a deterministic Turing machine T decides language BHP by computing the first n steps of each of the possible computation paths of the nondeterministic Turing machine Mi applied to x, then the worst-case running-time of T must be exponential, since Mi applied to x may have a choice of an exponential number of computation paths. So if T is to decide language BHP and still run in polynom...

In this paper we present some concepts for sound and fast footstep planning. The soundness is achieved with a two-stage trajectory generation process that uses a smoothing homotopy. The fastness is achieved with swept volume approximations precomputed offline.

Chen andWilliams[2]show how precomputedz-buffer hnagesfromdifferent fixedviewing positions canbe reprojected toproduceanimagefora new viewpoint. Hereimagesareprecomputedfortwigsand branchesatvariouslevelsinthehierarchical structure ofa tree,and adaptivelycombined,dependingon thepositionof thenew viewpoint.The precomputedimages containmultiplez levelstoavoidmissingpixelsinthereconstruction, subp...