### Tabletop surfaces with mechanisms for input consist an

### Table 1: Consistent contact transitions. C denotes surface contact. Similar conditions apply for H (hand contact).

"... In PAGE 3: ... H , H0, H+ and C , C0, C+ denote hand and surface contact, respec- tively. Table1 shows the allowable motion transitions for con- tact. These are the same as that in Fig.... ..."

### Table 1). The goal was to study differences in size and shape among males and females, mapping the results of the two phylogenetic hypothesis already proposed for the canids, one molecular and the other constructed using morphological characters. Samples consisted of digital images of the dorsal surface of the skull of

### Table 1). 5. Again, alternate grid points in each of the I-J-K coordinate directions were removed to produce yet another volume grid (COARSE_VOL). Surface grids consisting of 56 patches were extracted as subsets from each of the volume grids as follows: 1. A surface grid containing 113,856 grid points and 108,736 grid panels (FINEST_SRF) was obtained from the FINEST_VOL2 grid.

"... In PAGE 12: ...12 Table1 Summary of F-16XL geometries, grids, and grid usages. Grid Description Grid Size Surface Resolution Grid Usage FINEST_VOL1 Half configuration volume grid w/tip missiles amp; launchers 30 blocks 1,502,138 grid points Not applicable Not used for the current studies FINEST_VOL2 Full configuration volume grid w/inlet fairing 36 blocks 6,293,908 grid points Not applicable Future Euler and Navier-Stokes code use planned MEDIUM_VOL Subset of FINEST_VOL2 grid 36 blocks 837,924 grid points Not applicable Future Euler and Navier-Stokes code use planned COARSE_VOL Subset of MEDIUM_VOL grid 36 blocks 118,216 grid points Not applicable Future Euler and Navier-Stokes code use planned FINEST_SRF Surface grid extracted from FINEST_VOL2 volume grid 56 patches 113,856 grid points 108,736 surface panels Execution attempted, exceeded available RAM MEDIUM_SRF Surface grid extracted from MEDIUM_VOL volume grid 56 patches 29,772 grid points 27,184 surface panels Execution attempted, exceeded available disk space COARSE_SRF1 Surface grid extracted from COARSE_VOL volume grid 56 patches 8,118 grid points 6,796 surface panels Execution completed, unreasonably large forces and moments computed COARSE_SRF2 Surface grid extracted from COARSE_VOL volume grid 56 patches 2,434 grid points 1,744 surface panels Not used for the current studies COARSE_SRF3 Surface grid extracted from COARSE_VOL volume grid 56 patches 984 grid points 566 surface panels Used extensively for the current studies Table 2 Sample uncertainty analysis for F-16XL all values of input 0.... ..."

### Table 1: Average positional error accumulated over a simple polyhedral path (ten tours of a square of ap- proximately two feet by two feet). In general, the mag- nitude of the errors depends on various parameters of the trajectory but the relative magnitudes as a function of surface type vary consistently.

"... In PAGE 1: ... over which the robot is moving, an estimate of the rate of error accumulation for dead-reckoning allows us to accurately estimate how often localization, including sensor data acquisition, must be performed. For vari- ous oor coverings in our laboratory, for example, the rate of error accumulation varies by a factor of 10 (See Table1 ). The system we propose uses dead-reckoning and knowledge of the material over which it is mov- ing to maintain an estimate of its position and un- certainty in position.... ..."

### Table 1: Results of recognition The model is represented by a set of control points of a B-spline surface, and consists of a mean shape and a orthonormal basis de ning the shape space. With a global constraint, the model can provide a sensible solution space which we believe supports robust model-based applications. Applications of utilising this model for 3-D shape recovery, tracking and recognition have been demonstrated. Experimental results have shown that the method gives very encouraging results.

1995

Cited by 3

### Table 2: Dependency of the minimal surface area and the size of the cmc surface pe- riod on di erent levels of discretizations after 10 iterations. The number of triangles is counted per fundamental patch, the part of the o,c-to surface inside a cubical cell consists of 48 such fundamental patches. The values show that a coarse triangulation is su cient for a qualitatively correct solution of the period problem. The intermedi- ate time at which the zero period occurs is stable for triangulations which are not too coarse (more than 50 triangles in this case, compare the value for 31 triangles { for very coarse triangulations the value is not always as good as in this case).

1997

Cited by 19

### 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