"... In PAGE 12: ... Axes are graduated in centimeters. Initial conditions are given in Table2 . Again, the Case 3 simulation is augmented by an additional trajectory of points.... ..."

"... In PAGE 4: ... We counted the following elementary control point (CP) movement operations: drag-and-drop actions on the control-points that change their position, and undo operations on these. Table1 presents summary statistics for the curves and surfaces observed: minimum, maximum and average number of control points, as well as the number of movements made to control points per curve/surface. When a new control point is added to an existing curve, a point movement is always required1 in order to place that point in the desired position.... ..."

"... In PAGE 17: ... gets harder, the slope of the curve decreases. Table5 shows that most of the local planners reach their highest score for the surface to surface connections at r = 1:5. Our analysis of the graphs generally showed that if r = 1:5 was not the highest score, then it was the second best.... In PAGE 19: ... Note that in Table 4 it is clearly shown that the optimal s value gets higher as the environment gets harder. The Minkowski parameter graphs (Figures 26 and 27) and Table5 display two common trends in the alpha-puzzle environment. The free to surface connection score always reaches the highest value at either r = 2:5 or r = 3 while the highest value for surface to surface connections is around r = 1:5.... ..."

"... In PAGE 20: ...nd the Bernstein bound is 2mnd. Using Dixon apos;s resultant (Dixon 1908) and Theorem 2.1 this problem can be reduced to computing the eigendecomposition of 2mnd 2mnd matrix. In Table2 , we have highlighted the performance of the algorithm in (Manocha 1994) based on QR iterations with the improved algorithm presented in Section 4. The entry k corresponds to the number of solutions in the given domain for each case.... ..."

"... In PAGE 7: ...e., x#28u; v#29=ue 3 + c#28v#29: The symmetry group of the feature consists of trans- lations along the z-axis, G 0 = #1A#14 I #15e 3 0 1 #15 j#15 2 R #1B and a choice of M 0 is given by M 0 = n b #18 1 ; b #18 2 ; b #18 4 ; b #18 5 ; b #18 6 o : Table3 displays simulation results of the feature with 100 measurement points. The #0Crst row shows the estimated pro#0Cle tolerance under exact transfor- mation; the second row shows the computed pro#0Cle... ..."

"... In PAGE 9: ...igure 3. Coast down tests - observed and simulated. tractor (thick solid lines) respectively. Table2 shows the average error in the predicted acceleration for each curve in Figure 3. Table 2.... ..."

"... In PAGE 5: ... During each service cycle, the disk heads scan across the disk surfaces and retrieve one block of data for each stream. Table1 summarizes the environment which the simulation is based on. Note here, even without implementing the relaying mechanism, the system needs some memory to carry out jitter-free playback service.... ..."

"... In PAGE 4: ... The value of the sky background was estimated from the mean intensity of the eld region. The results of surface photometry of SagDIG are listed in Table3 and are displayed in Fig. 7.... In PAGE 5: ...Table3 re presents the mean major radius of an annular aperture, and rout represents the outer radius of an annular aperture. Fig.... ..."