Subdivision is a powerful paradigm for the generation of surfaces of arbitrary topology. Given an initial triangular mesh the goal is to produce a smooth and visually pleasing surface whose shape is controlled by the initial mesh. Of particular interest are interpolating schemes since they match

In this paper we introduce a method to simulate fluid flows on smooth surfaces of arbitrary topology: an effect never seen before. We achieve this by combining a two-dimensional stable fluid solver with an atlas of parametrizations of a Catmull-Clark surface. The contributions of this paper are: (i

Parameterizing meshes is a basic requirement for many applications, including, e.g., reverse engineering, texture mapping, and re-meshing. We present a new fast algorithm that uses the hierarchical representation of a polygonal mesh with arbitrary topology for generating a geometrydriven

A simple interpolatory subdivision scheme for quadrilateral nets with arbitrary topology is presented which generates C 1 surfaces in the limit. The scheme satisfies important requirements for practical applications in computer graphics and engineering. These requirements include the necessity

Abstract not found

Abstract not found

Surface parametrization is a fundamental problem in computer graphics. It is essential for operations such as texture mapping, texture synthesis, interactive 3D painting, remeshing, multi-resolution analysis and mesh compression. Conformal parameterization, which preserves angles, has many nice properties such as having no local distortion on textures, and being independent of triangulation or resolution. Existing conformal parameterization methods partition a mesh into several charts, each of which is then parametrized and packed to an atlas. These methods suffer from limitations such as difficulty in segmenting the mesh and artifacts caused by discontinuities between charts. This work

interactive 3D Livewire segmentation of complex

Local "belief propagation" rules of the sort proposed byPearl [12] are guaranteed to converge to the correct posterior probabilities in singly connected graphical models. Recently, a number of researchers have empirically demonstrated good performance of "loopy belief propagation" -- using these same rules on graphs with loops. Perhaps the most dramatic instance is the near Shannonlimit performance of "Turbo codes", whose decoding algorithm is equivalentto loopy belief propagation. Except for the

Subdivision is a powerful paradigm for the generation of surfaces of arbitrary topology. Given an initial triangular mesh the goal is to produce a smooth and visually pleasing surface whose shape is controlled by the initial mesh. Of particular interest are interpolating schemes since they match