Results 1  10
of
72,356
Surface Simplification Using Quadric Error Metrics
"... Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplifi ..."
Abstract

Cited by 1174 (16 self)
 Add to MetaCart
is able to join unconnected regions of models. This can facilitate much better approximations, both visually and with respect to geometric error. In order to allow topological joining, our system also supports nonmanifold surface models.
Fairing of NonManifold Models
 In IEEE Visualization 2000
, 2000
"... The concept of fairing applied to irregular triangular meshes has become more and more important. Previous contributions constructed better fairing operators, and applied them both to multiresolution editing tools and to multiresolution representations of meshes. In this paper, we generalize these p ..."
Abstract
 Add to MetaCart
these powerful techniques to handle nonmanifold models. Our framework computes a multilevel fairing of models by fairing both the twomanifold surfaces that define the model, the socalled twofeatures, and all the boundary and intersection curves of the model, the socalled onefeatures. In addition we
Polygonization of NonManifold Implicit Surfaces
, 1995
"... A method is presented to broaden implicit surface modeling. The implicit surfaces usually employed in computer graphics are two dimensional manifolds because they are defined by realvalued functions that impose a binary regionalization of space (i.e., an inside and an outside). When tiled, these su ..."
Abstract

Cited by 50 (0 self)
 Add to MetaCart
that are described in detail. Several example surfaces are defined and polygonized. CR Categories and Subject Descriptors: I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling  Curve, Surface, Solid, and Object Representations. Additional Keywords and Phrases: Implicit Surface, NonManifold
Fairing Of NonManifolds For Visualization
 IN PROCEEDINGS OF VIZ2000, IEEE VISUALIZATION
, 2000
"... The concept of fairing applied to irregular triangular meshes has become more and more important. Previous contributions constructed better fairing operators, and applied them both to multiresolution editing tools and to multiresolution representations of meshes. In this paper, we generalize these p ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
these powerful techniques to handle nonmanifold models. Our framework computes a multilevel fairing of models by fairing both the twomanifold surfaces that define the model, the socalled twofeatures, and all the boundary and intersection curves of the model, the socalled onefeatures. In addition we
Polygonization of NonManifold Implicit Surfaces
, 1995
"... A method is presented to broaden implicit surface modeling. The implicit surfaces usually employed in computer graphics are two dimensional manifolds because they are defined by realvalued functions that impose a binary regionalization of space (i.e., an inside and an outside). When tiled, these su ..."
Abstract
 Add to MetaCart
, these surfaces yield edges of degree two. The new method allows the definition of implicit surfaces with boundaries (i.e., edges of degree one) and intersections (i.e., edges of degree three or more). These nonmanifold implicit surfaces are defined by a multiple regionalization of space. The definition includes
Reflectance and texture of realworld surfaces
 ACM TRANS. GRAPHICS
, 1999
"... In this work, we investigate the visual appearance of realworld surfaces and the dependence of appearance on scale, viewing direction and illumination direction. At ne scale, surface variations cause local intensity variation or image texture. The appearance of this texture depends on both illumina ..."
Abstract

Cited by 590 (23 self)
 Add to MetaCart
of the BRDF measurements, we t the measurements to two recent models and obtain a BRDF parameter database. These parameters can be used directly in image analysis and synthesis of a wide variety of surfaces. The BTF, BRDF, and BRDF parameter databases have important implications for computer vision
Reconstruction and Representation of 3D Objects with Radial Basis Functions
 Computer Graphics (SIGGRAPH ’01 Conf. Proc.), pages 67–76. ACM SIGGRAPH
, 2001
"... We use polyharmonic Radial Basis Functions (RBFs) to reconstruct smooth, manifold surfaces from pointcloud data and to repair incomplete meshes. An object's surface is defined implicitly as the zero set of an RBF fitted to the given surface data. Fast methods for fitting and evaluating RBFs al ..."
Abstract

Cited by 505 (1 self)
 Add to MetaCart
noninterpolating approximation when the data is noisy. The functional representation is in effect a solid model, which means that gradients and surface normals can be determined analytically. This helps generate uniform meshes and we show that the RBF representation has advantages for mesh
Marching cubes: A high resolution 3D surface construction algorithm
 COMPUTER GRAPHICS
, 1987
"... We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divideandconquer approach to generate interslice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical d ..."
Abstract

Cited by 2696 (4 self)
 Add to MetaCart
We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divideandconquer approach to generate interslice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 660 (8 self)
 Add to MetaCart
, which is required for environment modeling (e.g., building a Digital Elevation Map). Objects are represented by a set of 3D points, which are considered as the samples of a surface. No constraint is imposed on the form of the objects. The proposed algorithm is based on iteratively matching points
Freeform deformation of solid geometric models
 IN PROC. SIGGRAPH 86
, 1986
"... A technique is presented for deforming solid geometric models in a freeform manner. The technique can be used with any solid modeling system, such as CSG or Brep. It can deform surface primitives of any type or degree: planes, quadrics, parametric surface patches, or implicitly defined surfaces, f ..."
Abstract

Cited by 701 (1 self)
 Add to MetaCart
A technique is presented for deforming solid geometric models in a freeform manner. The technique can be used with any solid modeling system, such as CSG or Brep. It can deform surface primitives of any type or degree: planes, quadrics, parametric surface patches, or implicitly defined surfaces
Results 1  10
of
72,356