### Table 1: Summary of normal meshing results for different models. The normal mesh is computed adaptively and contains roughly the same number of triangles as the original mesh.

"... In PAGE 6: ... 4 Results We have implemented the algorithms described in the preceding section, and performed a series of experiments in which normal meshes for various models were built. The summary of the results is given in Table1 . As we can see from the table, the normal semi- regular meshes have very high accuracy and hardly any non normal details.... ..."

### Table 1: Summary of normal meshing results for different models. The normal mesh is computed adaptively and contains roughly the same number of triangles as the original mesh.

"... In PAGE 6: ... 4 Results We have implemented the algorithms described in the preceding section, and performed a series of experiments in which normal meshes for various models were built. The summary of the results is given in Table1 . As we can see from the table, the normal semi- regular meshes have very high accuracy and hardly any non normal details.... ..."

### Table 1: Summary of normal meshing results for different models. The normal mesh is computed adaptively and contains roughly the same number of triangles as the original mesh. The relative L2

"... In PAGE 6: ... 4 Results We have implemented the algorithms described in the preceding section, and performed a series of experiments in which normal meshes for various models were built. The summary of the results is given in Table1 . As we can see from the table, the normal semi- regular meshes have very high accuracy and hardly any non normal details.... ..."

### Table 1: Summary of normal meshing results for different models. The normal mesh is computed adaptively and contains roughly the same number of triangles as the original mesh. The relative L2

### Table 1 Remeshing error between the irregular mesh and the normal mesh (S2S distance relative to the bounding box diagonal). Base represents the number of triangles of the base mesh Model |Vir||Tir| Base Refinement level |Tsr| Remeshing error (%)

2005

"... In PAGE 6: ....3. First assumption: an optimal remeshing Notice that the normal remesher provides a normal mesh Msr very close to the original irregular mesh Mir. Table1 shows that the S2S distance between these two meshes is negligible (lower than 0.016% of the bounding box diagonal).... ..."

### Table 1: Summary of our results. The number of triangles is the total number sent to the pipeline: number of triangles in base mesh 3 tetrahedra per base triangle 4 triangles per tetrahedron.

2005

"... In PAGE 7: ... We can use textures with a resolution up to 512 512 32 with no additional cost than stor- ing the texture data (x y z RGB ), plus its equivalent 3D texture for the detail normals. Table1 summarizes our results. In Color plate (E left), we show an application of our technique on a highly triangulated model (8640 triangles for the base mesh, 25920 tetrahe- dra in total) using a texture of a tree (resolution: 128 128 32).... ..."

Cited by 3

### Table 1: Comparison of computational cost for a regular grid, for linear and nonlinear problems; typically, the average numbers for an arbitirary grid are close. For the hinge, triangle-averaged and midedge normal stencils the number of DOFs per energy term in the interior of the mesh does not depend on mesh connectivity. The diagrams show in red the boundary of the area in which all DOFs share an energy term with the vertex DOF marked with the red dot. For the midedge normal operator we average over all (vertex and edge) DOFs.

2006

"... In PAGE 8: ... Figure 11: From left to right: a surface obtained by minimiz- ing thin plate energy using the cotangent discretization; same surface after 10 iterations of normal smoothing; a surface ob- tained using the midedge normal discretization, with vertex normals computed by averaging face normals; same surface with midedge normals used to compute vertex normals. Finally, we compare the computational cost of several opera- tors (see Table1 ). We consider two measures of efficiency: the number of floating-point operations needed to evaluate the en- ergy or its Hessian, and the number of nonzeros in the Hessian matrix, which typically determines the cost of a solve.... ..."

Cited by 6

### Table 2 Quantitative measures of the change in the mesh and discrete surface characteristics for CN optimization and RJ optimization for triangular and mixed meshes of a pig (Figure 8); distances are presented as a percentage of the problem size.

"... In PAGE 17: ... The normalized average condition number for an element is defined as the mean of the condition numbers at the vertices of an element, normalized so that an equilateral triangle or square quadrilateral will produce a value of 1. Table2 shows various quantities computed to measure the change in the meshes and the discrete surfaces using the two methods of optimization. In the... ..."

### Table 1: Triangle Counts

"... In PAGE 6: ... We tested bending along the y-axis of the object and measured the amount of subdivision that occurred. The results are summarized in Table1 and are shown in Plate 1. The first two cases show the greatest amount of subdivision since the original mesh is composed of flat Triangle Count... ..."