Point-based multiscale surface representation
In this article we present a new multiscale surface representation based on point samples. Given an unstructured point cloud as input, our method first computes a series of point-based surface approximations at successively higher levels of smoothness, ...
Solution space navigation for geometric constraint systems
We study the well documented problem of systematically navigating the potentially exponentially many roots or realizations of well-constrained, variational geometric constraint systems. We give a scalable method called the Equation and Solution Manager (...
Fitting B-spline curves to point clouds by curvature-based squared distance minimization
Computing a curve to approximate data points is a problem encountered frequently in many applications in computer graphics, computer vision, CAD/CAM, and image processing. We present a novel and efficient method, called squared distance minimization (...
Animating Chinese paintings through stroke-based decomposition
This article proposes a technique to animate a Chinese style painting given its image. We first extract descriptions of the brush strokes that hypothetically produced it. The key to the extraction process is the use of a brush stroke library, which is ...
Extended subdivision surfaces: Building a bridge between NURBS and Catmull-Clark surfaces
An extended subdivision surface (ESub) is a generalization of Catmull Clark and NURBS surfaces. Depending on the knot intervals and valences of the vertices and faces, Catmull Clark as well as NURBS patches can be generated using the extended ...
All-frequency relighting of glossy objects
We present a technique for interactive rendering of glossy objects in complex and dynamic lighting environments that captures interreflections and all-frequency shadows. Our system is based on precomputed radiance transfer and separable BRDF ...
Animation planning for virtual characters cooperation
This paper presents an approach to automatically compute animations for virtual (human-like and robot) characters cooperating to move bulky objects in cluttered environments. The main challenge is to deal with 3D collision avoidance while preserving the ...
A tangent subdivision scheme
In this article, we propose a new subdivision scheme based on uniform Powell-Sabin spline subdivision. It belongs to the class of vector subdivision schemes; for each vertex, we have three control points that form a control triangle tangent to the ...
Intrinsic subdivision with smooth limits for graphics and animation
This article demonstrates the definition of subdivision processes in nonlinear geometries such that smoothness of limits can be proved. We deal with curve subdivision in the presence of obstacles, in surfaces, in Riemannian manifolds, and in the ...
Forward rasterization
We describe forward rasterization, a class of rendering algorithms designed for small polygonal primitives. The primitive is efficiently rasterized by interpolation between its vertices. The interpolation factors are chosen to guarantee that each pixel ...
Discrete conformal mappings via circle patterns
We introduce a novel method for the construction of discrete conformal mappings from surface meshes of arbitrary topology to the plane. Our approach is based on circle patterns, that is, arrangements of circles---one for each face---with prescribed ...
Accurate detection of symmetries in 3D shapes
We propose an automatic method for finding symmetries of 3D shapes, that is, isometric transforms which leave a shape globally unchanged. These symmetries are deterministically found through the use of an intermediate quantity: the generalized moments. ...