Multiresolution analysis of arbitrary meshes
Matthias Eck,Tony DeRose,Tom Duchamp,Hugues Hoppe,Michael Lounsbery,Werner Stuetzle +5 more
- pp 173-182
TLDR
A method for overcoming the subdivision connectivity restriction, meaning that completely arbitrary meshes can now be converted to multiresolution form, is presented, based on the approximation of an arbitrary initial mesh M by a mesh MJ that has subdivision connectivity and is guaranteed to be within a specified tolerance.Abstract:
In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly becoming commonplace. Such meshes are notoriously expensive to store, transmit, render, and are awkward to edit. Multiresolution analysis offers a simple, unified, and theoretically sound approach to dealing with these problems. Lounsbery et al. have recently developed a technique for creating multiresolution representations for a restricted class of meshes with subdivision connectivity. Unfortunately, meshes encountered in practice typically do not meet this requirement. In this paper we present a method for overcoming the subdivision connectivity restriction, meaning that completely arbitrary meshes can now be converted to multiresolution form. The method is based on the approximation of an arbitrary initial mesh M by a mesh MJ that has subdivision connectivity and is guaranteed to be within a specified tolerance. The key ingredient of our algorithm is the construction of a parametrization of M over a simple domain. We expect this parametrization to be of use in other contexts, such as texture mapping or the approximation of complex meshes by NURBS patches. CRread more
Citations
More filters
Book
Computer Vision: Algorithms and Applications
TL;DR: Computer Vision: Algorithms and Applications explores the variety of techniques commonly used to analyze and interpret images and takes a scientific approach to basic vision problems, formulating physical models of the imaging process before inverting them to produce descriptions of a scene.
Proceedings ArticleDOI
Progressive meshes
TL;DR: The progressive mesh (PM) representation is introduced, a new scheme for storing and transmitting arbitrary triangle meshes that addresses several practical problems in graphics: smooth geomorphing of level-of-detail approximations, progressive transmission, mesh compression, and selective refinement.
Journal ArticleDOI
Reverse engineering of geometric models—an introduction
TL;DR: Specific issues addressed include characterization of geometric models and related surface representations, segmentation and surface fitting for simple and free-form shapes, multiple view combination and creating consistent and accurate B-rep models.
Proceedings ArticleDOI
Least squares conformal maps for automatic texture atlas generation
TL;DR: This paper introduces a new quasi-conformal parameterization method, based on a least-squares approximation of the Cauchy-Riemann equations, which can parameterize large charts with complex borders, and introduces segmentation methods to decompose the model into charts with natural shapes, and a new packing algorithm to gather them in texture space.
Proceedings ArticleDOI
QSplat: a multiresolution point rendering system for large meshes
Szymon Rusinkiewicz,Marc Levoy +1 more
TL;DR: This work describes a system for representing and progressively displaying meshes that combines a multiresolution hierarchy based on bounding spheres with a rendering system based on points, which is suitable for large data sets.
References
More filters
Journal ArticleDOI
A theory for multiresolution signal decomposition: the wavelet representation
TL;DR: In this paper, it is shown that the difference of information between the approximation of a signal at the resolutions 2/sup j+1/ and 2 /sup j/ (where j is an integer) can be extracted by decomposing this signal on a wavelet orthonormal basis of L/sup 2/(R/sup n/), the vector space of measurable, square-integrable n-dimensional functions.
Book
Data Structures and Algorithms
TL;DR: The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.
Proceedings ArticleDOI
Decimation of triangle meshes
TL;DR: An application independent algorithm that uses local operations on geometry and topology to reduce the number of triangles in a triangle mesh and results from two different geometric modeling applications illustrate the strengths of the algorithm.
Proceedings ArticleDOI
Zippered polygon meshes from range images
Greg Turk,Marc Levoy +1 more
TL;DR: A method for combining a collection of range images into a single polygonal mesh that completely describes an object to the extent that it is visible from the outside is presented.