This paper describes an algorithm for performing arbitrary translations and rotations of objects represented by octrees. Given an octree in a standard position and a transformation, the algorithm builds a new tree in a top down fshion, visiting each node in the new tree only once, and constructing only those nodes that appear in the final tree. It works by projecting the transformed space over ...

ÐFor large time-varying data sets, memory and disk limitations can lower the performace of visualization applications. Algorithms and data structures must be explicitly designed to handle these data sets in order to achieve more interactive rates. The Temporal Branch-on-Need Octree (T-BON) extends the three-dimensional branch-on-need octree for time-varying isosurface extraction. This data stru...

This course note describes a fast point-based method for computing diffuse and glossy global illumination, area light illumination and soft shadows, HDRI environment map illumination, multiple diffuse reflection bounces, final gathering for photon mapping, ambient occlusion, reflection occlusion, and volume scattering. The results are free of noise and the run-time does not increase due to disp...

This paper describes a method for surface reconstruction from sparse three-dimensional (3D) data that performs the reconstruction by building a sequence of surfaces approximating the data at increasing level of details (LOD). The method is simple, fast and suitable for a progressive 3D data/model representation, archiving, transmission. The surface reconstruction is obtained by a volumetric met...

The construction of a three-dimensional object model from a set of images taken from different viewpoints is an important problem in computer vision. One of the simplest ways to do this is to use the silhouettes of the object (the binary classification of images into object and background) to can construct a bounding volume for the object. To efficiently represent this volume, we use an octree,...

This paper presents an efficient and accurate method for the integration of discontinuous functions on a background mesh in three dimensions. This task is important in computational mechanics applications where internal interfaces are present in the computational domain. The proposed method creates boundary-conforming integration subcells for composed numerical quadrature, even in the presence ...