Results 11  20
of
240
Automatic reconstruction of Bspline surfaces of arbitrary topological type
 SIGGRAPH'96
, 1996
"... Creating freeform surfaces is a challenging task even with advanced geometric modeling systems. Laser range scanners offer a promising alternative for model acquisition—the 3D scanning of existing objects or clay maquettes. The problem of converting the dense point sets produced by laser scanners in ..."
Abstract

Cited by 173 (0 self)
 Add to MetaCart
(Show Context)
Creating freeform surfaces is a challenging task even with advanced geometric modeling systems. Laser range scanners offer a promising alternative for model acquisition—the 3D scanning of existing objects or clay maquettes. The problem of converting the dense point sets produced by laser scanners into useful geometric models is referred to as surface reconstruction. In this paper, we present a procedure for reconstructing a tensor product Bspline surface from a set of scanned 3D points. Unlike previous work which considers primarily the problem of fitting a single Bspline patch, our goal is to directly reconstruct a surface of arbitrary topological type. We must therefore define the surface as a network of Bspline patches. A key ingredient in our solution is a scheme for automatically constructing both a network of patches and a parametrization of the data points over these patches. In addition, we define the Bspline surface using a surface spline construction, and demonstrate that such an approach leads to an efficient procedure for fitting the surface while maintaining tangent plane continuity. We explore adaptive refinement of the patch network in order to satisfy userspecified error tolerances, and demonstrate our method on both synthetic and real data.
Displaced subdivision surfaces
 Siggraph 2000, Computer Graphics Proceedings, Annual Conference Series, pages 85–94. ACM Press / ACM SIGGRAPH
, 2000
"... In this paper we introduce a new surface representation, the displaced subdivision surface. It represents a detailed surface model as a scalarvalued displacement over a smooth domain surface. Our representation defines both the domain surface and the displacement function using a unified subdivisio ..."
Abstract

Cited by 158 (2 self)
 Add to MetaCart
(Show Context)
In this paper we introduce a new surface representation, the displaced subdivision surface. It represents a detailed surface model as a scalarvalued displacement over a smooth domain surface. Our representation defines both the domain surface and the displacement function using a unified subdivision framework, allowing for simple and efficient evaluation of analytic surface properties. We present a simple, automatic scheme for converting detailed geometric models into such a representation. The challenge in this conversion process is to find a simple subdivision surface that still faithfully expresses the detailed model as its offset. We demonstrate that displaced subdivision surfaces offer a number of benefits, including geometry compression, editing, animation, scalability, and adaptive rendering. In particular, the encoding of fine detail as a scalar function makes the representation extremely compact. Additional Keywords: geometry compression, multiresolution geometry, displacement maps, bump maps, multiresolution editing, animation.
Articulated Body Deformation from Range Scan Data
, 2002
"... This paper presents an examplebased method for calculating skeletondriven body deformations. Our example data consists of range scans of a human body in a variety of poses. Using markers captured during range scanning, we construct a kinematic skeleton and identify the pose of each scan. We then c ..."
Abstract

Cited by 152 (6 self)
 Add to MetaCart
This paper presents an examplebased method for calculating skeletondriven body deformations. Our example data consists of range scans of a human body in a variety of poses. Using markers captured during range scanning, we construct a kinematic skeleton and identify the pose of each scan. We then construct a mutually consistent parameterization of all the scans using a posable subdivision surface template. The detail deformations are represented as displacements from this surface, and holes are filled smoothly within the displacement maps. Finally, we combine the range scans using knearest neighbor interpolation in pose space. We demonstrate results for a human upper body with controllable pose, kinematics, and underlying surface shape.
Normal Meshes
, 2000
"... Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offset from a coarser version. Hence the mesh can be stored with a single float per vertex. We present an algorithm to approxi ..."
Abstract

Cited by 144 (8 self)
 Add to MetaCart
Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offset from a coarser version. Hence the mesh can be stored with a single float per vertex. We present an algorithm to approximate any surface arbitrarily closely with a normal semiregular mesh. Normal meshes can be useful in numerous applications such as compression, filtering, rendering, texturing, and modeling.
Consistent Mesh Parameterizations
, 2001
"... A basic element of Digital Geometry Processing algorithms is the establishment of a smooth parameterization for a given model. In this paper we propose an algorithm which establishes parameterizations for a set of models. The parameterizations are called consistent because they share the same base d ..."
Abstract

Cited by 133 (3 self)
 Add to MetaCart
A basic element of Digital Geometry Processing algorithms is the establishment of a smooth parameterization for a given model. In this paper we propose an algorithm which establishes parameterizations for a set of models. The parameterizations are called consistent because they share the same base domain and respect features. They give immediate correspondences between models and allow remeshes with the same connectivity. Such remeshes form the basis for a large class of algorithms, including principal component analysis, wavelet transforms, detail and texture transfer between models, and nway shape blending. We demonstrate the versatility of our algorithm with a number of examples.
Variational Problems and Partial Differential Equations on Implicit Surfaces: The Framework and Examples in Image Processing and Pattern Formation
, 2000
"... this paper. The key ..."
The Correlated Correspondence Algorithm for Unsupervised Registration of Nonrigid Surfaces.
 In Proc. of Neural Information Processing Systems (NIPS).
, 2004
"... Figure 1 : Several frames from a motion animation generated by interpolating two scans of a puppet (far left and far right), which were automatically registered using the Correlated Correspondence algorithm. Abstract We present an unsupervised algorithm for registering 3D surface scans of a deforma ..."
Abstract

Cited by 113 (4 self)
 Add to MetaCart
Figure 1 : Several frames from a motion animation generated by interpolating two scans of a puppet (far left and far right), which were automatically registered using the Correlated Correspondence algorithm. Abstract We present an unsupervised algorithm for registering 3D surface scans of a deformable object in very different configurations. Our algorithm does not use markers, nor does it assume prior knowledge about object shape, the dynamics of its deformation, or its alignment. The algorithm finds the correspondences between points in the two meshes using a joint probabilistic model over all point correspondences. This model combines preservation of local mesh geometry with more global constraints that capture the preservation of geodesic distance between corresponding pairs of points in the two meshes. Our approach successfully registers scans that exhibit large transformations, including both movement of articulate parts and nonrigid surface deformations. It applies even when one of the meshes is an incomplete range scan; thus, it can be used to automatically fill in the remaining surfaces for this partial scan, even if those surfaces were previously only seen in a different configuration. We also show how our results can be used to interpolate between two scans of a nonrigid object in a way that preserves surface geometry, leading to natural motion paths. Finally, we show that a registration of multiple scans in different configurations allows us to automatically identify components in articulate objects.
NonDistorted Texture Mapping For Sheared Triangulated Meshes
, 1998
"... This article introduces new techniques for nondistorted texture mapping on complex triangulated meshes. Texture coordinates are assigned to the vertices of the triangulation by using an iterative optimization algorithm, honoring a set of constraints minimizing the distortions. As compared to other ..."
Abstract

Cited by 113 (2 self)
 Add to MetaCart
(Show Context)
This article introduces new techniques for nondistorted texture mapping on complex triangulated meshes. Texture coordinates are assigned to the vertices of the triangulation by using an iterative optimization algorithm, honoring a set of constraints minimizing the distortions. As compared to other global optimization techniques, our method allows the user to specify the surface zones where distortions should be minimized in order of preference. The modular approach described in this paper results in a highly flexible method, facilitating a customized mapping construction. For instance, it is easy to align the texture on the surface with a set of user defined isoparametric curves. Moreover, the mapping can be made continuous through cuts, allowing to parametrize in one go complex cut surfaces. It is easy to specify other constraints to be honored by the soconstructed mappings, as soon as they can be expressed by linear (or linearizable) relations. This method has been integrated successfully within a widely used C.A.D. software dedicated to geosciences. In this context, applications of the method comprise numerical computations of physical properties stored in fine grids within texture space, unfolding geological layers and generating grids that are suitable for finite element analysis. The impact of the method could be also important for 3D paint systems.
Topological Noise Removal
"... Meshes obtained from laser scanner data often contain topological noise due to inaccuracies in the scanning and merging process. This topological noise complicates subsequent operations such as remeshing, parameterization and smoothing. We introduce an approach that removes unnecessary nontrivial to ..."
Abstract

Cited by 105 (4 self)
 Add to MetaCart
(Show Context)
Meshes obtained from laser scanner data often contain topological noise due to inaccuracies in the scanning and merging process. This topological noise complicates subsequent operations such as remeshing, parameterization and smoothing. We introduce an approach that removes unnecessary nontrivial topology from meshes. Using a local wave front traversal, we discover the local topologies of the mesh and identify features such as small tunnels. We then identify nonseparating cuts along which we cut and seal the mesh, reducing the genus and thus the topological complexity of the mesh.
SemiRegular Mesh Extraction from Volumes
, 2000
"... We present a novel method to extract isosurfaces from distance volumes. It generates high quality semiregular multiresolution meshes of arbitrary topology. Our technique proceeds in two stages. First, a very coarse mesh with guaranteed topology is extracted. Subsequently an iterative multiscale f ..."
Abstract

Cited by 104 (13 self)
 Add to MetaCart
(Show Context)
We present a novel method to extract isosurfaces from distance volumes. It generates high quality semiregular multiresolution meshes of arbitrary topology. Our technique proceeds in two stages. First, a very coarse mesh with guaranteed topology is extracted. Subsequently an iterative multiscale forcebased solver refines the initial mesh into a semiregular mesh with geometrically adaptive sampling rate and good aspect ratio triangles. The coarse mesh extraction is performed using a new approach we call surface wavefront propagation. A set of discrete isodistance ribbons are rapidly built and connected while respecting the topology of the isosurface implied by the data. Subsequent multiscale refinement is driven by a simple forcebased solver designed to combine good isosurface fit and high quality sampling through reparameterization. In contrast to the Marching Cubes technique our output meshes adapt gracefully to the isosurface geometry, have a natural multiresolution structure and good aspect ratio triangles, as demonstrated with a number of examples.