### Table 1. Blurred Shape Model algorithm

"... In PAGE 3: ... This contribution is weighted according to the distance between the point and the center of coordinates ci of the region ri. Table1 shows the algorithm. In fig.... ..."

### Table 11 Geometric Graphs with 200 Points

### Table I. Some statistics for large and small models. LDSs are local surface descriptors and SGFs are salient geometric features.

2006

Cited by 25

### Table 3 Examples of numerical shape descriptors used to compute geometric visual concepts

### Table 1 List of evaluated descriptors

2003

"... In PAGE 9: ... Therefore, the experiments used only the convex salience points along the contour. Table1 shows the set of implemented shape descriptors. The proposed descriptors (D2 and D3) are compared with the single fractal dimension (D1), two classical descriptors (Fourier descriptors (D4) and moment invariants (D5)) and two recently published shape descriptors (CSS (D6) and BAS (D7)).... ..."

### Table 1. Geometric Objects and Their Features.

2004

"... In PAGE 4: ...g. the sum and the dif- ference of the radii of a torus) as listed in Table1 . Polygonal loop root points (extended features of planar faces) are the centroids of their edge loops.... ..."

Cited by 9

### Table 2: Point predicate sets for various geometric genericity notions.

"... In PAGE 21: ...xample 5.1 Consider again the queries in Example 3.2. Query 4 can be expressed in F O[between] as f b v j (9 b v 1 )(9 b v 2 )(9 b v 3 )(S( b v 1 ) ^ S( b v 2 ) ^ S( b v 3 ) ^ triangle( b v;; b v 1 ;; b v 2 ;; b v 3 ))g;; where triangle( b v;; b v 1 ;; b v 2 ;; b v 3 ) states of the point b v that is in the triangle spanned by the points b v 1 , b v 2 , and b v 3 . The predicate triangle( b v;; b v 1 ;; b v 2 ;; b v 3 ) is an abbreviation for the formula (9 b p)(between( b v 1 ;; b p;; b v 2 ) ^ between( b v 3 ;; b v;; b p)): Query 5 can be expressed in FO[between;; equidistance]as (9 b c)(9 b u)(9 b v)(8 b p)(R ( b p) , equidistance( b c;; b p;; b u;; b v)): 2 Weintend to show that, for each of the sets of point predicates listed in Table2 ,the language FO[ ] captures precisely all geometric queries expressible in FO[R] that are generic with respect to the corresponding genericity notion.... In PAGE 26: ... 2 This concludes the case of the language FO[between]. It now turns out that the other instances of Table2 can be dealt with in almost the same way. Theorem 5.... ..."

### TABLE I. Reconstruction time and positional accuracy analysis for 30 in-volume implants. The factor F illustrates the speed of the autoreconstruction method.

### Table 2: A d-dimensional geometric file of N points.

Cited by 1

### Table 2: A d-dimensional geometric file of N points.

Cited by 1