### Table 1: Basis functions used in HIRAD. The bases are: constant = f 1g, linear = constant [ f 2; 3g, bilinear = linear [ f 4g, quadratic = bilinear [ f 5; 6g, cubic = quadratic [ f 7; 8; 9; 10g. No bilinear basis is offered for triangular patches since it seems not be be suited for hierarchical refinement (see x3.4).

1996

"... In PAGE 5: ...4). Table1 shows the basis functions (u; v) as defined on the unit square [0; 1]2 for quadrilaterals and on the standard triangle (0; 0); (1; 0); (0; 1) for triangular patches. They were obtained by orthogonalising the functions 1; u; v; uv; u2; v2; u3; u2v; uv2; v3 using the Gram-Schmidt orthogonalisation procedure known from basic algebra.... ..."

Cited by 8

### Table 4 (patch availability).

"... In PAGE 8: ...data samples are extremely small. Year Distribution Parameters all Weibull = 0:209, k = 4:040 2001 Weibull = 0:109, k = 0:199 2002 Weibull = 0:212, k = 5:559 2003 Weibull = 0:222, k = 4:299 2004 Weibull = 0:288, k = 14:04 2005 Weibull = 0:159, k = 0:428 Table4 : Best ts to the patch availability (after disclosure) Table 4 lists the best matches to the availability of patched af- ter disclosure. These Weibull distribution are reasonable matches.... In PAGE 8: ...data samples are extremely small. Year Distribution Parameters all Weibull = 0:209, k = 4:040 2001 Weibull = 0:109, k = 0:199 2002 Weibull = 0:212, k = 5:559 2003 Weibull = 0:222, k = 4:299 2004 Weibull = 0:288, k = 14:04 2005 Weibull = 0:159, k = 0:428 Table 4: Best ts to the patch availability (after disclosure) Table4 lists the best matches to the availability of patched af- ter disclosure. These Weibull distribution are reasonable matches.... ..."

### Table 3: Combining patches

2000

Cited by 2

### Table 6: The performance of the patch optimization using different patch size bounds.

2002

"... In PAGE 10: ... Next, we study how the performance of our algorithm varies with the patch size bound, K, for values ranging uni- formly from 20 to 45. The first two columns in Table6 list the average vertex per triangle ratio (VPT) and the average number of sequential strips, both of which decrease as the patch size increases. The second row in the table lists the results for the original FTSG.... ..."

Cited by 11

### Table 6: The performance of the patch optimization using difierent patch size bounds.

"... In PAGE 10: ... Next, we study how the performance of our algorithm varies with the patch size bound, K, for values ranging uni- formly from 20 to 45. The flrst two columns in Table6 list the average vertex per triangle ratio (VPT) and the average number of sequential strips, both of which decrease as the patch size increases. The second row in the table lists the results for the original FTSG.... ..."

### Table 1: Quadratic or Nonparametric?

2001

"... In PAGE 8: ... The squared L2 risks of the estimators are computed based on 100 replications. The numbers in the parentheses in Table1 are the corresponding standard errors. Quadratic regression works much better than the nonparametric alternatives for the rst two cases, but becomes much worse for the latter two due to lack of exibility.... ..."

Cited by 13

### Table 1. Description of the parameters in simple (3-patch) and complex (4-patch) models of the dynamics of patches in an engineered system.

in Patch

2004

"... In PAGE 2: ... Patches are transformed from the active state to the degraded state when the patch is abandoned, and patches change from degraded to potential through a process of recovery (Fig. 1A, Table1 ). If we denote the proportion of patches in the potential, active, and degraded states at time t by P, A, and D respectively, then we know that 1C30PC27AC27D (1) We assume that a unit of active habitat has a constant probability per unit time of decaying into the degraded state (d) and that a unit of degraded habitat has a constant probability per unit time of recovering to the potential state (r).... ..."

### Table Size for Quadratic Interpolation

1998

Cited by 1