### Table 1: Geometric information

"... In PAGE 20: ... e = QG gt;(G gt;QG) 1e fforcing the constraint G gt; e = eg x01 = 0; x02 = 0; x03 = e fchoose the initial guessg b1 = g; b2 = d = f B gt; e; b3 = 0 fcompute right hand sideg d = K3x0 b fcompute the defectg r0 = D3 ^ L 1 3 d fapply the transformationg p0 = w0 = D 1 3 r0 fpreconditioningg 0 = (w0; r0) for n = 0 step 1 until n quot; 0 do vn = D3 ^ L 1 3 K3pn fmatrix vector multiplication and transformationg = (vn; pn) = n+1= xn+1 = xn pn fupdate the iterateg rn+1 = rn vn fupdate the defectg wn+1 = D 1 3 rn+1 fpreconditioningg n+1 = (wn+1; rn+1) = n+1= n pn+1 = wn+1 + pn fupdate of the search directiong end for Figure 1: Domain decomposition with 8 subdomains In Table1 , the geometric informations about the domain decomposition and the discretization are listed for the re nement levels L used. Starting from the coarsest grid with 192 triangles for the whole domain , the re ned meshes are recursively constructed by subdividing each triangle into four smaller similar triangles.... In PAGE 21: ...Table 1: Geometric information In all following tables, a uni ed notation is used. L again denotes the re nement level and Table1 gives the corresponding information of the grids. t1 and t2 are the measured times in seconds for setting up the corresponding system of linear equations and for their solution.... ..."

Cited by 1

### Table 1. Geometrical information and degrees of freedom for various levels

"... In PAGE 11: ... All calculations have been done on the levels 3-5. Table1 shows the corre- sponding geometrical information and degrees of freedom.... ..."

### Table 3. Space required by the various data structures, compared with the space required by the reference mesh, including geometric information.

2002

"... In PAGE 46: ...ust one o set for each split (e.g., we assume collapes to the mid-point of an edge). The space complexities of the reference mesh, and of some meaningful data structures, are reported in Table3 . We have considered the general-... ..."

Cited by 8

### Table 1 Relations determining the edge node spacing based on geometric information Steps Relations Control parameters

2003

Cited by 2

### Table 2.1: The coordinates of the corner points of the blocks of the geometric layout information as shown in Figure 2.1.

### Table 3: Information and use provided by the ancillary datasets (relative to the geometric processing)

1999

"... In PAGE 32: ... These datasets are generated at the SCF and then delivered to the DAAC for use in routine processing. Table3 summarizes information in and intended use of each dataset, relative to the geometric processing. The construction of each of these datasets is described in detail in the corresponding Algorithm Theoretical Basis documents.... In PAGE 32: ... In this section, only a brief overview on the creation and use of the supporting datasets is given. Table3 : Information and use provided by the ancillary datasets (relative to the geometric processing) Dataset Information Provided Use Ancillary Geometric Product (AGP) 1. Map grid definition.... ..."

### Table 3: Information and use provided by the ancillary datasets (relative to the geometric processing)

1999

"... In PAGE 32: ... These datasets are generated at the SCF and then delivered to the DAAC for use in routine processing. Table3 summarizes information in and intended use of each dataset, relative to the geometric processing. The construction of each of these datasets is described in detail in the corresponding Algorithm Theoretical Basis documents.... In PAGE 33: ... To obtain tie points during registration 2. To georeference new MISR image registered to ROI Table3 : Information and use provided by the ancillary datasets (relative to the geometric processing) Dataset Information Provided Use Level 1 Georectified Radiance Product Algorithm Theoretical Basis 3-13 the projection is 1.1 km; this defines the horizontal sampling for each of the parameters.... ..."

### Table 1: Geometric Structure.

2007

"... In PAGE 6: ...BACKGROUND 3 2.1 Conformal Geometry Theory The geometric information of a surface has many layers, as shown in Table1 . Higher struc- tures determine lower structures.... ..."

### Table 1. A tabulation of the top 5 matches for each query. The scores indicate the size of the maximal clique found, normalized by the average number of nodes in the two trees. Note that only the topology of the shock trees was used; the addition of geometric information permits ner comparisons [27].

1999

"... In PAGE 9: ... Figure 3 shows the maximal subtree isomorphisms (each in one-to-one correspondence with a maximal clique) for three examples. The top 5 matches for each query shape, along with the associated scores, are shown in Table1 . The matching algorithm generally takes only two to three seconds to converge on a Sparc 10.... ..."

Cited by 121

### Table 1: A tabulation of the top 8 topological matches for each query. The scores indicate the average of the fraction of nodes matched in each of the two trees (see text). Note that only the topology of the shock trees was used; the addition of geometric information permits ner discrimination.

1999

"... In PAGE 16: ... (We shall consider the geometry shortly). We selected 25 silhouttes representing eight di erent object classes ( Table1 , rst column); the tool shapes were taken from the Rutgers Tools database. Each shape was then matched against all entries in the database.... In PAGE 16: ...ools database. Each shape was then matched against all entries in the database. Figure 6 shows the maximal subtree isomorphisms found by the algorithm for three examples. The top 8 matches for each query shape, along with the associated scores, are shown in Table1 . The scores indicate the average of n=n1 and n=n2, where n is the size of the maximal clique found, and n1 and n2 are the number of nodes in each tree.... ..."

Cited by 7