Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...
The craft of papercutting is part of the folk art traditions of cultures all over the world. From the point of view of computer graphics, papercutting can be seen as a method of c...
Interactive animation systems often use a level-of-detail (LOD) control to reduce the computational cost by eliminating unperceivable details of the scene. Most methods employ a m...
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
Oliver van Kaick, Ghassan Hamarneh, Hao Zhang 0002...
A fundamental challenge for existing shadow map based algorithms is dealing with partially illuminated surfaces. A conventional shadow map built with a pinhole camera only determi...
We describe a new, analytic approximation to the airlight integral from scattering media whose density is modeled as a sum of Gaussians. The approximation supports real-time rende...
Kun Zhou, Qiming Hou, Minmin Gong, John Snyder, Ba...
Articulated body animation with smooth skin deformation is an important topic in computer graphics. This paper presents a pipeline that extends articulated body deformation to the...
Taehyun Rhee, John P. Lewis, Ulrich Neumann, Krish...
We complete and bring together two pairs of surface constructions that use polynomial pieces of degree (3,3) to associate a smooth surface with a mesh. The two pairs complement ea...
We consider the problem of generating a map between two triangulated meshes, M and M’, with arbitrary and possibly differing genus. This problem has rarely been tackled in its g...