### Table 1. Restoration of the height map from various smoothed surface normal vector fields. Surface Normal Number of

2002

"... In PAGE 3: ... The result- ing heights have been smoothed by averaging in a a0 a40 a0 neighbourhood in two passes over the entire image. The MCE between the vector fields obtained from the esti- mated height map and those provided initially are shown in Table1 . We can observe from this table that we obtain a quite accurate representation of the surface normals de- rived from the estimated height map.... ..."

Cited by 1

### Table 1. Smoothing algorithms evaluation

"... In PAGE 3: ... We consider the surface normal vector field of the digital elevation map from Fig- ure 1b as a reference vector field. The mean square error (MSE) and the mean cosine error (MCE) for the angle be- tween the reference and the smoothed surface normal vector field, when smoothing is performed by using averaging (7), marginal median (8), vector median (9) and surface consis- tency is provided in Table1 . If the reference and smoothed normal vectors would have the same orientation, then the cosine of their angle would be 1.... In PAGE 3: ... If the reference and smoothed normal vectors would have the same orientation, then the cosine of their angle would be 1. From Table1 we see that robust estimators provide better shape modeling capabili-... ..."

### Table 1. Timing statistics for preprocessing step-1: impressionist image rendering (IIR).

"... In PAGE 22: ...003 0.038 Examining the IIR results shown in Table1 , we see that pre-processing step-1 of our technique only requires several seconds and usually less than 1 second. The most time-consuming procedure is smoothing the vector field 200 times, requiring over 92% of the total preprocessing time.... ..."

### Table 3 Cohomologies for Lie algebras of vector fields

1994

"... In PAGE 10: ... 2]. Table3 describes the cohomology spaces H1(h; C1=M) for each of the Lie algebras and corresponding modules. The rst column indicates the dimension of the cohomology space, and the second column gives a representa- tive cocycle of each nontrivial cohomology class.... ..."

Cited by 6

### Table 1: Fields and algorithms for manipulation tasks with programmable vector #0Celds.

"... In PAGE 16: ...al equilibria #28i.e., force and moment#29. Finding tight bounds on the number of total equilibria|that is, tak- ing momentinto account|will be critical in the future. 7 Conclusions Table1 summarizes #0Celds and algorithms for manipu- lation tasks with programmable vector #0Celds, and in- cludes some additional recent results. Less di#0Ecult tasks such as translation can be achieved with relatively simple #0Celds and without any planning.... ..."

### Table 1: Fields and algorithms for manipulation tasks with programmable vector elds.

"... In PAGE 16: ...al equilibria (i.e., force and moment). Finding tight bounds on the number of total equilibria|that is, tak- ing moment into account|will be critical in the future. 7 Conclusions Table1 summarizes elds and algorithms for manipu- lation tasks with programmable vector elds, and in- cludes some additional recent results. Less di cult tasks such as translation can be achieved with relatively simple elds and without any planning.... ..."

### Table 1: Fields and algorithms for manipulation tasks with programmable vector elds.

"... In PAGE 14: ... Furthermore, because of its full pixel- wise programmability, the new chip will allow us to closely approximate ideal radial elds. 7 Conclusions Table1 summarizes elds and algorithms for ma- nipulation tasks with programmable vector elds, and includes some additional recent results. Less di cult tasks such as translation can be achieved with relatively simple elds and without any planning.... ..."

### Table 1: Fields and algorithms for manipulation tasks with programmable vector elds.

"... In PAGE 16: ...al equilibria (i.e., force and moment). Finding tight bounds on the number of total equilibria|that is, tak- ing moment into account|will be critical in the future. 7 Conclusions Table1 summarizes elds and algorithms for manipu- lation tasks with programmable vector elds, and in- cludes some additional recent results. Less di cult tasks such as translation can be achieved with relatively simple elds and without any planning.... ..."