Results 1  10
of
104
A volumetric method for building complex models from range images,”
 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
View Dependent Isosurface Extraction
 In IEEE Visualization ’98
, 1998
"... We propose a new approach to polygonal isosurface extraction that is based on extracting only the visible portion of the isosurface. The visibility tests are done in two phases. First, coarse visibility tests are performed in software to determine the visible cells. These tests are based on hierarch ..."
Abstract

Cited by 78 (11 self)
 Add to MetaCart
on hierarchical tiles and shearwarp factorization. The second phase resolves the visible portions of the extracted triangles and is accomplished by the graphics hardware. While the latest isosurface extraction methods have effectively eliminated the search phase bottleneck, the cost of constructing and rendering
Quality isosurface mesh generation using an extended marching cubes lookup table
 Comput. Graph. Forum
"... The Marching Cubes Algorithm may return degenerate, zero area isosurface triangles, and often returns isosurface triangles with small areas, edges or angles. We show how to avoid both problems using an extended Marching Cubes lookup table. As opposed to the conventional Marching Cubes lookup table, ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The Marching Cubes Algorithm may return degenerate, zero area isosurface triangles, and often returns isosurface triangles with small areas, edges or angles. We show how to avoid both problems using an extended Marching Cubes lookup table. As opposed to the conventional Marching Cubes lookup table
Optimizing the Topological and Combinatorial Complexity of Isosurfaces
 In ComputerAided Design
, 2005
"... Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing watertight constructions of triangulated approximations of isosurfaces. Most approaches divide the 3D space into cubes that each occupy the space between eight neighboring samples ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
— criteria, often using precomputed lookup tables or simple construction rules. Instead, we propose global strategies for optimizing several topological and combinatorial measures of the isosurfaces: triangle count, genus, and number of shells. We describe efficient implementations of these optimizations
Hierarchical IsoSurface Extraction
"... The extraction and display of isosurfaces 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 isosurface 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 isosurface at the finer volume levels. To be able to reconstruct fine detail
Regularised Marching Tetrahedra: Improved IsoSurface Extraction
 Computers and Graphics
, 1998
"... Marching cubes is a simple and popular method for extracting isosurfaces from implicit functions or discrete threedimensional (3D) 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 isosurfaces from implicit functions or discrete threedimensional (3D) 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
Isosurfaces on Optimal Regular Samples
"... Volumetric samples on Cartesian lattices are less efficient than samples on bodycentred cubic (BCC) lattices. We show how to construct isosurfaces on BCC lattices using several different algorithms. Since the mesh that arises from BCC lattices involves a large number of cells, we show two alternate ..."
Abstract
 Add to MetaCart
alternate methods of reducing the number of cells by clumping tetrahedra into either octahedra or hexahedra. We also propose a theoretical model for estimating triangle counts for various algorithms, and present experimental results to show that isosurfaces generated using one of our algorithms can
An Interactive Isosurface Visualization Cluster
"... distributed computing, interactive visualization, interval tree, isosurface, multiresolution representation, scientific visualization Extraction and rendering of isosurfaces from large volume data is a computationally expensive task. To achieve interactive isosurface visualization, we have developed ..."
Abstract
 Add to MetaCart
comprehensive study of the interplay between the compute nodes (a PC cluster), the host node (a graphicsenhanced PC), the data (voxels and triangles), and user actions (isovalue and view changes) to derive a resourceconscious, usercentered metric for designing effective solutions for largescale isosurface
Marching Cubes 33: Construction of Topologically Correct Isosurfaces
, 1995
"... An algorithm implemented in the HIGZ graphics package for the construction of isosurfaces from volumetric datasets is discussed. This algorithm is an improved version of the Marching Cubes method. For each cell considered independently, the algorithm permits the construction of a triangle model, the ..."
Abstract

Cited by 57 (0 self)
 Add to MetaCart
An algorithm implemented in the HIGZ graphics package for the construction of isosurfaces from volumetric datasets is discussed. This algorithm is an improved version of the Marching Cubes method. For each cell considered independently, the algorithm permits the construction of a triangle model
Results 1  10
of
104