Results 1 
7 of
7
Surface reconstruction from unorganized points
 COMPUTER GRAPHICS (SIGGRAPH ’92 PROCEEDINGS)
, 1992
"... We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1�:::�xng IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be know ..."
Abstract

Cited by 649 (8 self)
 Add to MetaCart
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1�:::�xng IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be known in advance — all are inferred automatically from the data. This problem naturally arises in a variety of practical situations such as range scanning an object from multiple view points, recovery of biological shapes from twodimensional slices, and interactive surface sketching.
Mesh optimization
, 1993
"... We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same topological type as M0, that fits the data well and has a small number of vertices. Our approach is to minimize an energy f ..."
Abstract

Cited by 352 (9 self)
 Add to MetaCart
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same topological type as M0, that fits the data well and has a small number of vertices. Our approach is to minimize an energy function that explicitly models the competing desires of conciseness of representation and fidelity to the data. We show that mesh optimization can be effectively used in at least two applications: surface reconstruction from unorganized points, and mesh simplification (the reduction of the number of vertices in an initially dense mesh of triangles).
Piecewise smooth surface reconstruction
, 1994
"... We present a general method for automatic reconstruction of accurate, concise, piecewise smooth surface models from scattered range data. The method can be used in a variety of applications such as reverse engineering — the automatic generation of CAD models from physical objects. Novel aspects of t ..."
Abstract

Cited by 270 (13 self)
 Add to MetaCart
We present a general method for automatic reconstruction of accurate, concise, piecewise smooth surface models from scattered range data. The method can be used in a variety of applications such as reverse engineering — the automatic generation of CAD models from physical objects. Novel aspects of the method are its ability to model surfaces of arbitrary topological type and to recover sharp features such as creases and corners. The method has proven to be effective, as demonstrated by a number of examples using both simulated and real data. A key ingredient in the method, and a principal contribution of this paper, is the introduction of a new class of piecewise smooth surface representations based on subdivision. These surfaces have a number of properties that make them ideal for use in surface reconstruction: they are simple to implement, they can model sharp features concisely, and they can be fit to scattered range data using an unconstrained optimization procedure.
Geometric Simplification and Compression
 in Multiresolution Surface Modeling, Course Notes #25, SIGGRAPH'97
, 1997
"... this paper focuses on polygon count reduction techniques that exploit an original triangular mesh and derive simplified models by eliminating vertices or triangles, by collapsing edges, or by merging adjacent faces. ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
this paper focuses on polygon count reduction techniques that exploit an original triangular mesh and derive simplified models by eliminating vertices or triangles, by collapsing edges, or by merging adjacent faces.
Pattern vector based reduction of large multimodal data sets for fixed rate interactivity during visualization of multiresolution models
, 1998
"... ..."
Simplification and Compression of 3D Scenes
, 1997
"... INTRODUCTION....................................................................................4 2. A SIMPLE DATASTRUCTURE FOR TRIANGULATED MESHES.................................6 3. TOPOLOGICAL CHARACTERIZATION OF POLYHEDRA........................................7 3.1 TOPOLOGICAL CONCEPTS AND DE ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
INTRODUCTION....................................................................................4 2. A SIMPLE DATASTRUCTURE FOR TRIANGULATED MESHES.................................6 3. TOPOLOGICAL CHARACTERIZATION OF POLYHEDRA........................................7 3.1 TOPOLOGICAL CONCEPTS AND DEFINITIONS .......................................................................................7 3.1.1 Topological closure, interior, and boundary............................................................................7 3.1.2 Dimensional homogeneity.................................................................................................8 3.1.3 Regularization and Boolean operations..................................................................................8 3.1.4 Connectedness, holes, and handles.......................................................................................9 3.1.5 NonManifold conditions..............................................................
Dealing with Shape Complexity for Internet Access and Graphic Applications
"... Standard representations of 3D models are so verbose that only very simple models can be accessed over common communication links for immediate viewing. This situation is not likely to improve, since the need for more accurate 3D models and their deployment throughout a broader spectrum of industria ..."
Abstract
 Add to MetaCart
Standard representations of 3D models are so verbose that only very simple models can be accessed over common communication links for immediate viewing. This situation is not likely to improve, since the need for more accurate 3D models and their deployment throughout a broader spectrum of industrial, scientific, and consumer application areas will outpace the improvements in transmission bandwidth to the office, home, or mobile worker or private user. Recently developed multiresolution modeling technologies play an important role in addressing this bandwidth bottleneck, especially when combined with other approaches, such as intelligent culling, prefetching, and imagebased rendering. This tutorial will discuss the details of compression, simplification, and progressive transmission techniques and of their interrelations.