### Table 5: Triangle number of a multi-resolution head and neck mesh using adaptive Marching Cubes

1996

Cited by 72

### Table 2: Triangle number of a multi-resolution fractal ellipsoid-flake mesh using adaptive Marching Cubes

1996

"... In PAGE 16: ...ig. 9c, and 2. 0 in Fig. 9d, and the running times are 190sec, 260sec, 190sec, and 163sec, respectively. The simplification results of all the multi-resolution ellipsoid-flake volume rasters are presented in Table2 .... ..."

Cited by 72

### Table 1: The results using a grayscale cube and a grayscale sphere. The Marching Cubes cube has 864 vertices and 1724 triangles. The SurfaceNet cubes have 866 vertices and 1728 triangles. The decimated meshes have half and quarter the number of faces of the original mesh. The Marching Cubes sphere has 4536 vertices and 8204 triangles. The SurfaceNets have 4442 vertices and 8880 triangles. The decimated meshes have 0:5 or 0:25 the number of faces of the original mesh. The number of SurfaceNet relaxations is xed to 5 in all cases. (SNA = averaging, SNG = gradient based, SNAG = averaging and gradient based)

2000

Cited by 2

### Table 1: Timings (in seconds) for tesselating several implicit surface models. The marching cubes approach invokes either the tri-linear interpolation disambiguation method (left) or a tetrahedral decomposition of cells (center) to produce a topologically consistent mesh

2001

"... In PAGE 9: ... Our experiments demonstrate that it is difficult to compare the marching triangles and the marching cubes algorithms as the marching triangles adapt to the curvature of the surface, whereas the marching cubes relies on fixed size cells to poly- gonize an implicit surface. Table1 reports several statistics for meshing the bird model and other shapes displayed in Figure 7. The march- ing cubes rely on a voxel decomposition of space, and the size of the seed cube was defined as 1a6 50th of the size of the bounding box of the implicit model.... ..."

Cited by 16

### Table 1: Comparison of marching cubes (MC) and adaptive skeleton climbing (ASC), with block sizes N = 1;2;4;8, and marching cubes, in term of triangle count (4) and CPU time.

"... In PAGE 9: ... More importantly, the proposed algorithm is a on-the-fly process which re- quires no time-consuming postprocessingtriangle reduction. In fact, the algorithm produces coarser mesh in a smaller amount of time (see Table1 ). This is quite different from those triangle reduction algorithms.... In PAGE 9: ... Once we have initialized the values in occ[] for eachlign in the block, the emptiness of the block can be immediately identified. Table1 and Fig. 24 quantify for various datasets the results of our implementation of adaptive skeleton climb- ing with four block sizes, N = 1, 2, 4 and 8.... In PAGE 10: ...Table 1: Comparison of marching cubes (MC) and adaptive skeleton climbing (ASC), with block sizes N = 1;2;4;8, and marching cubes, in term of triangle count (4) and CPU time. (a) (b) Figure 24: Graphical presentation of the results shown in Table1 .... ..."

### Table 1: Table of case counts for substitopes. Each of the twelve sub-tables contains the case-counts for the tuple (shapeGroup, col- orGroup, polytope, n, k), with n and k in the range [1..4]. Each row of sub-tables shares (shapeGroup, colorGroup), as indicated in the middle. The left column contains sub-tables for simplexes; the right column for cubes. Case-counts specifically mentioned in this paper are highlighted in boldface. 1Marching Cubes. 2Marching Hypercubes. 3Interval Volume. 4Sweeping Simplices. 5Contour Meshing. 6Separating Surfaces. 7Counting Cases (this paper).

2003

Cited by 9

### Table 2. Performance of CVR on the geometric data sets. data set # CVs # SVs CPU time

2005

"... In PAGE 6: ... Finally, the mesh is computed by the commonly-used marching cubes algorithm. Results are shown in Figure 4 and Table2 . Note that, again, CVR is very fast.... ..."

Cited by 5

### Table 2. Performance of CVR on the geometric data sets. data set # CVs # SVs CPU time

2005

"... In PAGE 6: ... Finally, the mesh is computed by the commonly-used marching cubes algorithm. Results are shown in Figure 4 and Table2 . Note that, again, CVR is very fast.... ..."

Cited by 5

### Table 2. Performance of CVR on the geometric data sets. data set # CVs # SVs CPU time

2005

"... In PAGE 6: ... Finally, the mesh is computed by the commonly-used marching cubes algorithm. Results are shown in Figure 4 and Table2 . Note that, again, CVR is very fast.... ..."

Cited by 5

### 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... ..."