We present the necessary theory for the integration of subdivision surfaces into general purpose rendering systems. The most important functionality that has to be provided via an abstract geometry interface are the computation of surface points and normals as well as the ray intersection test. We demonstrate how to derive the corresponding formulas and how to construct tight bounding volumes f...

We present a scheme for collision detection of flexible models. This scheme relies on a multiresolution technique of: 1) object location tracking to decrease time complexity, 2) the combination of bounding boxes (AABBs) and a hash grid function, and 3) computation of distance domain to determine collision with a contact surface. Experiments show that this approach can efficiently detect collisi...

This chapter presents a brief outline of our current knowledge of the structures of the bounding membranes (the inner and the outer membranes and the intermediate periplasmic layer) of a Gram-negative bacterial cell. Also the structure and chemical composition of the outer membrane vesicles (OMVs) originating from the surface of these bacteria including their proteomic profile, as obtained main...

We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L2 functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Pes...

We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Pesk...

We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Pesk...

The problem of computing the minimum-angle bounding cone of a set of three-dimensional vectors has numerous applications in computer graphics and in geometric modeling. One such application is bounding the tangents of space curves or the vectors normal to a surface in the computation of the intersection of two surfaces. Surprisingly, no optimal-time exact solution to this problem has been yet g...

Many problems in areas such as computer graphics, scientific visualization, computational geometry, or image processing require the computation of a distance field. The distance field indicates at each point in space the shortest distance to a given object. Depending on the problem setting, the object is described either by a voxel attribute within a volume data set or by a surface representati...

Luminaire sampling plays an important role in global illumination calculation using Monte Carlo integration. A conventional approach generates samples on the surface of the luminaire, resulting in rendered images with high variance of noise. In this paper, we present an efficient solid angle sampling technique using tunable bounding volumes for global illumination calculation. In contrast to th...