Results 1  10
of
85
Feature Sensitive Surface Extraction from Volume Data
"... The representation of geometric objects based on volumetric data structures has advantages in many geometry processing applications that require, e.g., fast surface interrogation or boolean operations such as intersection and union. However, surface based algorithms like shape optimization (fairing) ..."
Abstract

Cited by 153 (10 self)
 Add to MetaCart
The representation of geometric objects based on volumetric data structures has advantages in many geometry processing applications that require, e.g., fast surface interrogation or boolean operations such as intersection and union. However, surface based algorithms like shape optimization (fairing) or freeform modeling often need a topological manifold representation where neighborhood information within the surface is explicitly available. Consequently, it is necessary to find effective conversion algorithms to generate explicit surface descriptions for the geometry which is implicitly defined by a volumetric data set. Since volume data is usually sampled on a regular grid with a given step width, we often observe severe alias artifacts at sharp features on the extracted surfaces. In this paper we present a new technique for surface extraction that performs feature sensitive sampling and thus reduces these alias effects while keeping the simple algorithmic structure of the standard Marching Cubes algorithm. We demonstrate the effectiveness of the new technique with a number of application examples ranging from CSG modeling and simulation to surface reconstruction and remeshing of polygonal models. 1
Speeding up isosurface extraction using interval trees
 IEEE Transactions on Visualization and Computer Graphics
, 1997
"... ..."
OctreeBased Decimation of Marching Cubes Surfaces
, 1996
"... The Marching Cubes (MC) algorithm is a commonly used method for generating isosurfaces. The MC algorithm also generates an excessively large number of triangles to represent an isosurface. Generating many triangles increases the rendering time which is directly proportional to the number of triangle ..."
Abstract

Cited by 121 (0 self)
 Add to MetaCart
(Show Context)
The Marching Cubes (MC) algorithm is a commonly used method for generating isosurfaces. The MC algorithm also generates an excessively large number of triangles to represent an isosurface. Generating many triangles increases the rendering time which is directly proportional to the number of triangles. This paper presents a decimation method to reduce the number of triangles generated by the MC algorithm. Decimation is carried out within the framework of the MC algorithm before creating a large number of triangles. Four major steps comprise the reported implementation of the algorithm: a) surface tracking, b) merging, c) crack patching, and d) triangulation. Surface tracking is an enhanced implementation of the MC algorithm. Starting from a seed point, the surface tracker visits only those cells likely to compose part of the desired isosurface. This results in up to approximately 80% computational saving The cells making up the extracted surface are stored in an octree that is further p...
HardwareAccelerated Volume and Isosurface Rendering Based on CellProjection
, 2000
"... We present two beneficial rendering extensions to the Projected Tetrahedra (PT) algorithm by Shirley and Tuchman. These extensions are compatible with any cell sorting technique, for example the BSPXMPVO sorting algorithm for unstructured meshes. ..."
Abstract

Cited by 102 (14 self)
 Add to MetaCart
(Show Context)
We present two beneficial rendering extensions to the Projected Tetrahedra (PT) algorithm by Shirley and Tuchman. These extensions are compatible with any cell sorting technique, for example the BSPXMPVO sorting algorithm for unstructured meshes.
Realtime Exploration of Regular Volume Data by Adaptive Reconstruction of IsoSurfaces
 The Visual Computer
, 1999
"... Recent advances in the technology of 3D sensors and in the performance of numerical simulations result in the generation of volume data at ever growing size. In order to allow realtime exploration of even the highest resolution data sets, adaptive techniques benefiting from the hierarchical nature ..."
Abstract

Cited by 93 (3 self)
 Add to MetaCart
(Show Context)
Recent advances in the technology of 3D sensors and in the performance of numerical simulations result in the generation of volume data at ever growing size. In order to allow realtime exploration of even the highest resolution data sets, adaptive techniques benefiting from the hierarchical nature of multiresolution representations have gained special attention. In this paper we propose an adaptive approach to the fast reconstruction of isosurfaces from regular volume data at arbitrary levels of detail. The algorithm has been designed to enable realtime navigation through complex structures while providing useradjustable resolution levels. Since adaptive onthefly reconstruction and rendering is performed from a hierarchical octree representation of the volume data, the method does not depend on preprocessing with respect to a specific isovalue thus allowing the user to interactively browse through the pencil of isosurfaces. Special attention is paid to the fixing of cracks in...
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
(Show Context)
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 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 the isosurface remains high. Many of today's large datasets contain very large and complex isosurfaces that can easily overwhelm even stateoftheart graphics hardware. The proposed approach is output sensitive and is thus well suited for remote visualization applications where the extraction and rendering phases are done on a separate machines. 1 Introduction The marching cubes [11, 23] met...
Reconstruction of the human cerebral cortex from magnetic resonance images
 IEEE Trans. Med. Imag
, 1999
"... Abstract—Reconstructing the geometry of the human cerebral cortex from MR images is an important step in both brain mapping and surgical path planning applications. Difficulties with imaging noise, partial volume averaging, image intensity inhomogeneities, convoluted cortical structures, and the req ..."
Abstract

Cited by 69 (11 self)
 Add to MetaCart
(Show Context)
Abstract—Reconstructing the geometry of the human cerebral cortex from MR images is an important step in both brain mapping and surgical path planning applications. Difficulties with imaging noise, partial volume averaging, image intensity inhomogeneities, convoluted cortical structures, and the requirement to preserve anatomical topology make the development of accurate automated algorithms particularly challenging. In this paper we address each of these problems and describe a systematic method for obtaining a surface representation of the geometric central layer of the human cerebral cortex. Using fuzzy segmentation, an isosurface algorithm, and a deformable surface model, the method reconstructs the entire cortex with the correct topology, including deep convoluted sulci and gyri. The method is largely automated and its results are robust to imaging noise, partial volume averaging, and image intensity inhomogeneities. The performance of this method is demonstrated, both qualitatively and quantitatively, and the results of its application to six subjects and one simulated MR brain volume are presented. Index Terms—Cortical surface reconstruction, deformable surface models, fuzzy segmentation, isosurface, magnetic resonance imaging. I.
Optimal Isosurface Extraction from Irregular Volume Data (Addendum)
, 1996
"... This document is available in .ps format at our web site (http://miles.cnuce.cnr.it/cg/bibliography.html). This workwas partially founded by the Progetto Coordinato "Modelli multirisoluzione per la visualizzazione di campi scalari multidimensionali" of the Italian National Research Council ..."
Abstract

Cited by 64 (5 self)
 Add to MetaCart
This document is available in .ps format at our web site (http://miles.cnuce.cnr.it/cg/bibliography.html). This workwas partially founded by the Progetto Coordinato "Modelli multirisoluzione per la visualizzazione di campi scalari multidimensionali" of the Italian National Research Council (CNR). We wish to thank those who have made available on the public domain the datasets used in the evaluation of the proposed techniques. References
Multiresolution representation and visualization of volume data.
 IEEE Transactions on Visualization and Computer Graphics,
, 1997
"... ..."
Multiresolution Representations for Surfaces Meshes
 In Proceedings of the SCCG
, 1997
"... We describe a method for constructing multi resolution models (MRM) of complex triangle meshes and show how these representations can be used to create view dependent adaptive approximations of triangle meshes on the fly with guaranteed approximation error. We use a modified onesided Hausdorff d ..."
Abstract

Cited by 29 (7 self)
 Add to MetaCart
We describe a method for constructing multi resolution models (MRM) of complex triangle meshes and show how these representations can be used to create view dependent adaptive approximations of triangle meshes on the fly with guaranteed approximation error. We use a modified onesided Hausdorff distance as a geometrically meaningful error value between the original and the simplified mesh. Since this distance is parameterizationindependent, its use as error measure is superior to the use of the L 1 Norm between parameterized surfaces. The proposed multiresolution model supports progressive transmission, smooth geomorphing of different levels of detail approximations, mesh compression and selective error tolerance editing. Various examples demonstrate the excellent results that were achieved by this new method with triangle meshes from different application areas such as volume rendering, terrain modeling and the approximations of parameterized surfaces. CR Descriptors: ...