Results 1 - 10 of 1,290

A volumetric method for building complex models from range images,”

by Brian Curless , Marc Levoy - in Proceedings of the 23rd annual conference on Computer graphics and interactive techniques. ACM, , 1996
"... Abstract A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction, ..."
Abstract - Cited by 1020 (17 self) - Add to MetaCart
with the voxel grid and traverse the range and voxel scanlines synchronously. We generate the final manifold by extracting an isosurface from the volumetric grid. We show that under certain assumptions, this isosurface is optimal in the least squares sense. To fill gaps in the model, we tessellate over

Topology Verification for Isosurface Extraction

by Tiago Etiene, L. Gustavo Nonato, Carlos Scheidegger, Julien Tierny, Thomas J. Peters, Valerio Pascucci, Robert M. Kirby, Cláudio T. Silva , 2010
"... The importance of properly implemented isosurface extraction for verifiable visualization led to a previously published paper on the general Method of Manufactured Solutions (MMS), inclusive of a supportive software infrastructure. This work builds upon that foundation, while significantly extending ..."
Abstract - Cited by 11 (5 self) - Add to MetaCart
The importance of properly implemented isosurface extraction for verifiable visualization led to a previously published paper on the general Method of Manufactured Solutions (MMS), inclusive of a supportive software infrastructure. This work builds upon that foundation, while significantly

Regularised Marching Tetrahedra: Improved Iso-Surface Extraction

by G. M. Treece, R. W. Prager, A. H. Gee - Computers and Graphics , 1998
"... Marching cubes is a simple and popular method for extracting iso-surfaces from implicit functions or discrete three-dimensional (3-D) data. However, it does not guarantee the surface to be topologically consistent with the data, and it creates triangulations which contain many triangles of poor aspe ..."
Abstract - Cited by 71 (8 self) - Add to MetaCart
Marching cubes is a simple and popular method for extracting iso-surfaces from implicit functions or discrete three-dimensional (3-D) data. However, it does not guarantee the surface to be topologically consistent with the data, and it creates triangulations which contain many triangles of poor

Isosurface extraction and . . .

by G. Dupuy , Sebastion Guillon, Dimitri Komatitsch, et al. , 2008
"... In order to deal with the heavy trend in size increase of volumetric datasets, research in isosurface extraction has focused in the past few years on related aspects such as surface simplification and load balanced parallel algorithms. We present in this paper a parallel, bloc-wise extension of the ..."
Abstract - Add to MetaCart
In order to deal with the heavy trend in size increase of volumetric datasets, research in isosurface extraction has focused in the past few years on related aspects such as surface simplification and load balanced parallel algorithms. We present in this paper a parallel, bloc-wise extension

Parallel Construction and Isosurface Extraction of Recursive Tree Structures

by Dirk Bartz, Wolfgang Straßer , 1998
"... The visualization of volumetric datasets is usually limited by the amount of memory and processing power of computer systems. Several multiresolution methods have been developed in order to adapt the necessary work; recursive spatial tree structures, such as octrees, are among the most popular. The ..."
Abstract - Cited by 14 (2 self) - Add to MetaCart
visualization. Based on the thread model of the shared-memory paradigm, we developed a scheme for a balanced parallel construction. We apply this new scheme to generate isosurfaces in parallel, using the Marching Cubes algorithm. Keywords: Volume visualization, octrees, hierarchical data structures, thread

Interactive Out-Of-Core Isosurface Extraction

by Yi-Jen Chiang, Cláudio T. Silva, William J. Schroeder
"... In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a tw ..."
Abstract - Cited by 95 (18 self) - Add to MetaCart
In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a

PARALLEL CONSTRUCTION AND ISOSURFACE EXTRACTION OF RECURSIVE TREE STRUCTURES

by unknown authors
"... The visualization of volumetric datasets is usually limited by the amount of memory and processing power of computer systems. Several multiresolution methods have been developed in order to adapt the necessary work; recursive spatial tree structures, such as octrees, are among the most popular. The ..."
Abstract - Add to MetaCart
visualization. Based on the thread model of the shared-memory paradigm, we developed a scheme for a balanced parallel construction. We apply this new scheme to generate isosurfaces in parallel, using the Marching Cubes algorithm. Keywords: Volume visualization, octrees, hierarchical data structures, thread

Hierarchical Iso-Surface Extraction

by Ulf Labsik, Kai Hormann, Martin Meister, Günther Greiner
"... The extraction and display of iso-surfaces is a standard method for the visualization of volume data sets. In this paper we present a novel approach that utilizes a hierarchy on both the input and the output data. For the generation of a coarse base mesh, we construct a hierarchy of volumes and extr ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
and extract an iso-surface from the coarsest resolution with a standard Marching Cubes algorithm. We additionally apply a simple mesh decimation algorithm to improve the shape of the triangles. We iteratively fit this mesh to the iso-surface at the finer volume levels. To be able to reconstruct fine detail

Verifiable visualization for isosurface extraction

by Tiago Etiene, Carlos Scheidegger, L. Gustavo Nonato, Robert M. Kirby, Cláudio T. Silva, Senior Member - IEEE Transactions on Visualization and Computer Graphics
"... Fig. 1. Through the verification methodology presented on this paper we were able to uncover a convergence problem within a publicly available marching-based isosurfacing code (top left) and fix it (top right). The problem causes the mesh normals to disagree with the known gradient field when refini ..."
Abstract - Cited by 9 (5 self) - Add to MetaCart
extraction codes. Where applicable, these techniques allow us to distinguish whether anomalies in isosurface features can be attributed to the underlying physical process or to artifacts from the extraction process. Such scientific scrutiny is at the heart of verifiable visualization – subjecting

A maximum likelihood stereo algorithm

by Ingemar J. Cox, Sunita L. Hingorani, Satish B. Rao, Bruce M. Maggs - Computer Vision and Image Understanding , 1996
"... A stereo algorithm is presented that optimizes a maximum likelihood cost function. The maximum likelihood cost function assumes that corresponding features in the left and right images are Normally distributed about a common true value and consists of a weighted squared error term if two features ar ..."
Abstract - Cited by 234 (2 self) - Add to MetaCart
in this paper, matching is performed on the individual pixel intensities. Contrary to popular belief, the pixel-based stereo appears to be robust for a variety of images. It also has the advantages of (i) providing a dense disparity map, (ii) requiring no feature extraction and (iii) avoiding the adaptive
Results 1 - 10 of 1,290