### Table 1: Precision of the coordinates (Lv = 10, Du = 5, Nu = 5).

1998

Cited by 3

### Table 3: Coordination surface features. Precision and recall shown are across all examples, not just the buy and sell orders shown.

2005

"... In PAGE 7: ... The surface features are less effective for resolv- ing coordinations. As Table3 shows, they are very... ..."

Cited by 4

### Table 3: Average number of equivalent 32-bit operations per vertex coordinate for appropriate output precision

"... In PAGE 9: ... The leftmost column indicates the number of bits that are required in the output display. Table3 shows the average number of equivalent 32-bit opera- tions per vertex during the transformations while exploiting spatial and temporal coherences. Central to this idea is that one 32-bit operation is equivalent to two 16-bit, four 8-bit, and eight 4-bit op- erations.... ..."

### Table 2: Average Number of Bits per Vertex Coordinate Oper- ated upon for Appropriate Output Precision

"... In PAGE 9: ... Even from the closeup there is hardly any visual distinguishable difference. Table2 shows the average number of bits that have to be manipu- lated per vertex during the transformations while exploiting spatial and temporal coherences. Since the vertices that are at the lower levels of the octree require less number of bits for transformation, the overall average number of bits turns out to be much less.... ..."

### Table 9: Precision and recall with a one-word wider span of words on [Medic]. Coordination Insertion Permutation Total

"... In PAGE 14: ... An extension of the size of the window in which variants are observed would only slightly enhance the recall but would seriously degrade precision. Table9 reports the precision and the recall that can be expected from an extension of the word span. These results have to be compared with the results from Tables 5 and 6.... ..."

### Table 2. Uncertainty in meters as a function of latitude. Estimates of uncertainty are based on coordinate precision measured in degrees using the WGS84 reference ellipsoid and are rounded up to the next greater integer value.

### Table 1. These tables report which percentage of texture coordinates is predicted within a polygon, across polygons, as a nearby texture coordinate, and as the center of the bounding box. The corresponding bit-rates at a precision of 10 bits confirm the different success of these predictions.

"... In PAGE 4: ... Using a single context for all correctors would spoil the potentially low entropy of correctors that are result of more promising predictions with the anticipated poor outcome of the fall-back predictions. In Table1 we list the percentages with which the differ- ent prediction rules were used. Note that within-predictions can only occur in polygonal meshes.... ..."

### Table 1. These tables report which percentage of texture coordinates is predicted within a polygon, across polygons, as a nearby texture coordinate, and as the center of the bounding box. The corresponding bit-rates at a precision of 10 bits confirm the different success of these predictions.

"... In PAGE 4: ... Using a single context for all correctors would spoil the potentially low entropy of correctors that are result of more promising predictions with the anticipated poor outcome of the fall-back predictions. In Table1 we list the percentages with which the differ- ent prediction rules were used. Note that within-predictions can only occur in polygonal meshes.... ..."

### Table 1. Comparison of weighted shortest path algorithms that rely on geometric precision parameters. N represents the largest integer coordinate. Although the objective of [8] was di erent, the schemes are -approximations in which the dependence on n becomes comparable to [10] (see [9]).

"... In PAGE 2: ... Mata and Mitchell [10] presented an algorithm that constructs a graph (pathnet) which can be searched to obtain an approximate path; their path accuracy is (1 + W kw min ), where min is the minimum angle of any face of P, W=w is the largest to smallest weight ratio and k is a constant that depends upon . Table1 compares the running times for the -approximation algorithms de-... ..."

### TABLE 7. The scales of influence of various functions and orders of accuracy. Decay rate depends on the type of functions, the order of accuracy, the coordinate and the precision of variables used. The names of function show compact differencing by Diff., integration by Integ., midpoint interpolation by Intplt. and sine-Butterworth filter by S-B. For the S-B, only the waves of wavelengths 2h and 3h are considered.

2001