### Table 1: Comparison of Marching Triangles and Cubes

"... In PAGE 8: ... 7.1 Parametric Implicit Surfaces Results for three parametric implicit surfaces derived from algebraic expressions for a sphere, torus and jack are given in Table1... ..."

### Table 6: The performance of isosurface extraction (in seconds) for the F-18 data set.

1998

"... In PAGE 6: ... However, even with a high resolution of lattice subdivision we still had about 50% sav- ing in storage; for the smaller resolutions of lattice subdivision, we achieved about 75% ? 90% space savings. Table6 shows the performance of isosurface extraction using the temporal hierarchical index tree for the F-18 data set. We also show the performance of the regular Marching Cubes algorithm (denoted as MCs), the Interval Tree method (denoted as Int.... ..."

Cited by 33

### Table 6: The performance of isosurface extraction (in seconds) for the F-18 data set.

"... In PAGE 6: ... However, even with a high resolution of lattice subdivision we still had about 50#25 sav- ing in storage; for the smaller resolutions of lattice subdivision, we achieved about 75#25 , 90#25 space savings. Table6 shows the performance of isosurface extraction using the temporal hierarchical index tree for the F-18 data set. We also show the performance of the regular Marching Cubes algorithm (denoted as MCs), the Interval Tree method (denoted as Int.... ..."

### Table 1: The number of facets returned by the Discretized Marching Cubes and classic Marching Cubes algorithms on three different datasets.

1994

"... In PAGE 4: ... 3 Evaluation of results and conclusions We tested DiscMC on a series of different datasets and com- pared results with a classic MC implementation. Table1 re- ports the number of polygons generated and it refers to three datasets: Sphere is a voxelized sphere, Buckyball is the electron density around a molecule of C60 (courtesy of AVS International Centre) and Head is a CAT scanned dataset (courtesy of of Niguarda Hospital, Milan, Italy). The num- bers of facets and vertices returned by Classic MC and Dis- cMC are reported in Table 1.... ..."

Cited by 66

### Table 2: Results for the iso-surfaces of the MRI-heads in Fig.8 (iso-value 2926)

1996

"... In PAGE 10: ... Our algorithm does not exhibit constant behavior, but especially for the L2 norm the decay is quite low which means, that the triangulation of the volume implicitly results in an effective processing of the generated tetrahedra. As we can see in Table2 the time needed to generate the triangles is decreasing dramatically compared to the standard marching cubes algorithm. Looking at a special case we see, that in the first H1 image the number of triangles is less than one third and the processing time is about 9 times faster.... ..."

Cited by 3

### Table 1: The number of facets returned by the Discretized Marching Cubes and classic Marching Cubes algorithms on three difierent datasets.

"... In PAGE 4: ... 3 Evaluation of results and conclusions We tested DiscMC on a series of difierent datasets and com- pared results with a classic MC implementation. Table1 re- ports the number of polygons generated and it refers to three datasets: Sphere is a voxelized sphere, Buckyball is the electron density around a molecule of C60 (courtesy of AVS International Centre) and Head is a CAT scanned dataset (courtesy of of Niguarda Hospital, Milan, Italy). The num- bers of facets and vertices returned by Classic MC and Dis- cMC are reported in Table 1.... ..."

### Table 2: Iso-surface extraction for the MRI-heads and CAT- abdomens in Fig.7,

in The Multilevel Finite Element Method for Adaptive Mesh Optimization and Visualization of Volume Data

1997

"... In PAGE 6: ... Extraction time, generated triangles and image quality will be of interest. Considering the triangle generation speed with respect to the number of tetrahedra shown in Table2 , we see that the extraction time is nearly constant. An optimal algorithm would just inspect those tetrahedra, that contribute to the iso-surface.... In PAGE 6: ...7, Threshold = 0:2 exhibit constant behavior, but the decay is quite low which means, that the triangulation of the volume implicitly results in an effective processing of the generated tetrahedra. As we can see in Table2 the time needed to generate the tri- angles is decreasing significantly compared to the standard march- ing cubes algorithm. Looking especially at Head 1 we see, that the number of triangles is about a half and the processing time is about 6 times faster.... ..."

Cited by 37

### Table 1: Overview of dataset material properties for Marching Cubes.

1999

Cited by 7

### Table 1: Overview of dataset material properties for Marching Cubes.

1999

"... In PAGE 3: ... Correspondingly, isovalues, color values, and opacity for the materials have been selected for the MC algorithm as depicted in Table 1. We assign di erent opacities for resin using MC and RC (see Figure 2 and Table1 ). This is necessary to achieve somewhat similar visual results because the MC algorithm only extracts one layer of triangles (with some exceptions at the center of the cylinder).... ..."

Cited by 7

### Table 1: Sub-cube types and coordinate transformations Type Sub-cube # Coordinate transformation

2004

"... In PAGE 3: ... Let the coor- dinate system be (I;;J;;K). The five curve types are con- structed by the basic curve type with different coordinate transformations as shown in Table1 . A coordinate trans- formation with I, J, and K in different placement cor- responds to coordinate exchange, and with a minus sign ;I, ;J, and ;K corresponds to coordinate reverse.... ..."

Cited by 1