ACM Transactions on Graphics

Monte Carlo (MC) rendering systems can produce spectacular images but are plagued with noise at low sampling rates. In this work, we observe that this noise occurs in regions of the image where the sample values are a direct function of the random ...

With the increasing demands for photo-realistic image synthesis in real time, we propose a sparse multilinear model, which is named K-Clustered Tensor Approximation (K-CTA), to efficiently analyze and approximate large-scale multidimensional visual ...

The reflectance function of a scene point captures the appearance of that point as a function of lighting direction. We present an approach to printing the reflectance functions of an object or scene so that its appearance is modified correctly as a ...

The problem of decomposing a 3D mesh into meaningful segments (or parts) is of great practical importance in computer graphics. This article presents a variational mesh decomposition algorithm that can efficiently partition a mesh into a prescribed ...

This article presents a framework for symmetry-guided texture synthesis and processing. It is motivated by the long-standing problem of how to optimize, transfer, and control the spatial patterns in textures. The key idea is that symmetry ...

We present a sparse analytic representation for spherical functions, including those expressed in a Spherical Harmonic (SH) expansion, that is amenable to fast and accurate rotation on the GPU. Exploiting the fact that each band-l SH basis function can ...

We present a novel, topology-adaptive method for deformable interface tracking, called the Deformable Simplicial Complex (DSC). In the DSC method, the interface is represented explicitly as a piecewise linear curve (in 2D) or surface (in 3D) which is a ...