Discontinuity meshing has greatly enhanced the visual and numerical accuracy of radiosity solutions. However, its computational expense means that it cannot be used in dynamic interactive environments with current hardware. Techniques are proposed which allow the discontinuity information to be reused as the environment changes. These techniques complement existing dynamic radiosity methods whi...

Anti-aliasing in form factor computation and precise determination of shadow boundaries are important issires for Radiosity method. A-Buffer is a technique introduced by Carpenter f o r anti-aliasing in hidden surjiace removal. In this paper, we propose a method based on the A-Bilffer to replace the Zbtlffer in the computation of form factors using the Hemicube f o r anti-aliasing. The method d...

Fluorescence diffuse optical tomography (FDOT) is a computationally demanding imaging problem. The discretizations of FDOT forward and inverse problems pose a trade-off between the accuracy and the computational efficiency of the image reconstruction. To address this trade-off, we analyzed the effect of discretization on the accuracy of FDOT imaging and proposed novel adaptive meshing algorithm...

Detecting sharp illumination variations such as shadow boundaries is an important problem for radiosity methods. Such illumination variations are captured using a nonuniform mesh that refines the areas exhibiting high illumination gradients. Nonuniform meshing techniques like discontinuity meshing often rely on shadow casting, so their application is computationally expensive. This paper presen...

F. Labelle and J. Shewchuk have proposed a discrete definition of anisotropic Voronoi diagrams. These diagrams are parametrized by a metric field. Under mild hypotheses on the metric field, such Voronoi diagrams can be refined so that their dual is a triangulation, with elements shaped according to the specified anisotropic metric field. We propose an alternative view of the construction of the...

Provably correct algorithms for meshing difficult domains in three dimensions have been recently developed in the literature. These algorithms handle the problem of sharp angles (< π/2) between segments and between facets by constructing protective collars around these regions. The collars are approximately sized according to the local feature size of the input. With the eventual goal of develo...

We present an all-quad meshing algorithm for general domains. We start with a strongly balanced quadtree. In contrast to snapping the quadtree corners onto the geometric domain boundaries, we move them away from the geometry. Then we intersect the moved grid with the geometry. The resulting polygons are converted into quads with midpoint subdivision. Moving away avoids creating any flat angles,...

This paper presents the requirements for a surface mesh to be valid. Aside from validity, it also discusses conditions for geometric similarity, which quantitatively describes how the surface mesh “matches” the model geometry. The surface mesh generation method presented here uses the parameter space of a model face to generate a coarse triangulation. In order to avoid the mapping problem, the ...