Results 1  10
of
3,694
Interpolating Subdivision for Meshes with Arbitrary Topology
"... 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 the ..."
Abstract

Cited by 236 (24 self)
 Add to MetaCart
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
Flows on Surfaces of Arbitrary Topology
, 2003
"... 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 twodimensional stable fluid solver with an atlas of parametrizations of a CatmullClark surface. The contributions of this paper are: (i) ..."
Abstract

Cited by 92 (0 self)
 Add to MetaCart
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 twodimensional stable fluid solver with an atlas of parametrizations of a CatmullClark surface. The contributions of this paper are: (i
Parameterizing Meshes with Arbitrary Topology
 In Image and Multidimensional Digital Signal Processing
, 1998
"... Parameterizing meshes is a basic requirement for many applications, including, e.g., reverse engineering, texture mapping, and remeshing. We present a new fast algorithm that uses the hierarchical representation of a polygonal mesh with arbitrary topology for generating a geometrydriven parameteriz ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Parameterizing meshes is a basic requirement for many applications, including, e.g., reverse engineering, texture mapping, and remeshing. We present a new fast algorithm that uses the hierarchical representation of a polygonal mesh with arbitrary topology for generating a geometrydriven
Interpolatory Subdivision on Open Quadrilateral Nets with Arbitrary Topology
 Computer Graphics Forum
, 1996
"... 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 to ..."
Abstract

Cited by 154 (10 self)
 Add to MetaCart
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
Parametrization for Surfaces with Arbitrary Topologies
, 2002
"... Surface parametrization is a fundamental problem in computer graphics. It is essential for operations such as texture mapping, texture synthesis, interactive 3D painting, remeshing, multiresolution analysis and mesh compression. Conformal parameterization, which preserves angles, has many nice prop ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Surface parametrization is a fundamental problem in computer graphics. It is essential for operations such as texture mapping, texture synthesis, interactive 3D painting, remeshing, multiresolution 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
Correctness of belief propagation in Gaussian graphical models of arbitrary topology
 NEURAL COMPUTATION
, 1999
"... 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&q ..."
Abstract

Cited by 296 (7 self)
 Add to MetaCart
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
Interpolating Subdivision for Meshes with Arbitrary Topology
"... 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 the ..."
Abstract
 Add to MetaCart
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
Progress in Arbitrary Topology Deformable Surfaces
 In British Machine Vision Conference
, 1997
"... Most deformable surfaces used in computer vision are restricted to a simple underlying mesh topology. This is a considerable limitation when dealing with complicated objects whose topology is not known in advance. In previous work we introduced a deformable surface that can take on arbitrary topolog ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Most deformable surfaces used in computer vision are restricted to a simple underlying mesh topology. This is a considerable limitation when dealing with complicated objects whose topology is not known in advance. In previous work we introduced a deformable surface that can take on arbitrary
Results 1  10
of
3,694