### Table 3: The algorithm to compute the cutting surface.

"... In PAGE 4: ... This process can be performed efficiently by dynamic- programming techniques. Our algorithm( Table3 ) has the following properties: 1. The junction locations are computed from the sur-... ..."

### TABLE I. NUMBER OF ITERATIONS REQUIRED TO SELECT THE SURFACES FOR COMPUTING ASR BOUNDARY FOR EACH PATH

### Table1 Computation of scale values Surface

"... In PAGE 8: ...* Applying this transformation technique to all other measured properties we get a set of comparable parameters as this way the effect of different measurement units is eliminated. Table1 shows a simple example** comparing two parameters of seven different simulated genuine leather materials used for shoe uppers. Table1 Computation of scale values Surface ... In PAGE 11: ...easurement used. To exclude the effect of scales, the basic data are normalized, i.e. each property is divided by the standard deviation of that particular property. Applying this to the two parameters used in Table1 will result in the scatter plot shown on Fig. 6.... ..."

### Table 2: Total time (in seconds) of computing the surface (including the perturbation).

2003

"... In PAGE 5: ... Table 1 shows the time it took to find valid pole directions for several molecules with the original implementation as well as with the improved implementation. Table2 shows the total time it took to build the spherical arrangements (including the perturbation time) with the original implementation as well as with the improved implementation. The new implementation has other technical improvements in addition to the improvement described above (mainly due to inline expansion and passing variables by reference instead of by value, as well as caching the results of some calculations that occur more than once).... ..."

Cited by 1

### Table 1. Extrapolated times in seconds to compute the surface for 4000 atoms.

2003

### Table 2. Extrapolated times in seconds to compute the surface for 10000 atoms.

2003

### Table 2: Parsytec CC Computation Times for Surface Reconstruction

### Table 6-2. Optimal plane orientation and total surface flattening computation times for different surfaces on a 3.2 Ghz Pentium 4 Personal Computer.

2006

"... In PAGE 87: ... 6-2b, 6-2c and 6-2d and examine the resulting mean distortion factors and the resulting distortion map. Table6 -1. Flattened surfaces mean distortion factor using optimal parallel planes flattening and Bennis et.... In PAGE 88: ... This computation is iterated over all points of the surface until convergence of the positions of the points. Table6 -1 presents the results obtained with the two algorithms on the representative surfaces of Section 6.... In PAGE 88: ...igure 6-7. Flattened Gaussian surface (Fig. 6-2b) according to (a) the Bennis et. al. algorithm (without relaxation) and according to (b) the optimal parallel planes flattening. Table6 -1 and Fig. 6-7 show that the Gaussian surface flattened according to our method and flattened according to the Bennis et.... In PAGE 88: ... However, distortions are better distributed with optimal parallel planes flattening. For the Saddle surface and Saddle-Gaussian surface , Table6 -1, Figs. 6-8 and 6-9 show that our method yields less distorted flattened surfaces.... In PAGE 90: ....4.3 Computation times The computation of the optimal plane orientation needs to be carried out only once for each surface independently of the position of the focus point on the surface. Table6 -2 gives the number of discretization points used for the calculation and the corresponding computation times for each of the surfaces presented in Section 6.... ..."

### Table 6.3: Shader computation profile for the Cloud surface shader.

2004

Cited by 2