### 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 3. SAODV Topology Consistency Failures Destination Next-hop

"... In PAGE 6: ...able 2. Formal Methods used in MANET Security Analysis........................................................ 22 Table3 .... In PAGE 32: ... Control flow analysis techniques [77] predict possible value sets for process outcomes. Table3 provides the control flow analysis results on the CBS# defined SAODV, indicting an SAODV attacker can inject topology consistency failures. The failures contradict the true network topology from Figure 10 due to the malicious node na apos;s ability to spoof its sending address as either n1 or n2.... ..."

### Table 1 Increase of the mesh size

2003

"... In PAGE 10: ...he 3D Garment v2.0 system [19], the result is shown in Fig. 12j, 12k, and 12l. From the above examples and applications, it is easy to find that our extrusion approach is an intuitive, efficient geometric modeling tool for freeform polygonal object modeling. The number of vertices and faces of the toy design application and the fashion design application is shown in Table1 . Both the number of vertices and the number of faces are increased considerably after extrusion.... ..."

Cited by 4

### TABLE IX TIME (SEC.) AND SPACE (NUMBER OF STATES IN THE STATEFUL SEARCH) OVERHEADS OF FINDING COUNTEREXAMPLE 3 IN A CHAIN TOPOLOGY CONSISTING OF N NODES USING BEST-FIRST SEARCH 1. N Time (sec.) Number of states

in Incorporating Bounded Model Checking in Network Simulation: Theory, Implementation and Evaluation

### Table 6: Performance of CAG for the 3-D wave equation problem integration interpolation error estimation grid management

"... In PAGE 20: ... This process makes the uniform ne mesh terribly slow. The results in Table6 show that 17% and 38.8% of the execution time in run2 were spent on interpolation and grid management, respectively.... In PAGE 34: ... Table 5: Execution times and errors for the 3-D wave equation problem. Table6 : Performance of CAG for the 3-D wave equation problem.... ..."

### Table 3. Optimized Parameters for the Free-form GA-Designed GRIN Shaper Problem.

"... In PAGE 7: ...lass types are selected from four LightPath gradient glass types.19 See lines 34 and 40 in Appendix A of Ref. 15 for an example of this coding. See Table3 for a description of all parameters optimized in this problem. It should be noted that if the GA chooses less than four elements for a particular individual, the remaining surfaces are made into dummy surface in the code.... ..."

### Table 4. Free-form GA-Designed GRIN Shaper Parameters

"... In PAGE 7: ... The input and output profiles are shown in Figure 6. The parameters for the systems are given in Table4 and Table 5. The mean value of the output irradiance shown in Figure 6 is 101.... ..."

### Table 2. The optimized values for interpolation coefficients in the interpolated 3-D WGM.

2001

Cited by 3