### Table 1. The connectivity relations of a k-simplex mesh.

"... In PAGE 6: ... The constant connectivity between vertices im- plies a simple relation between the number of ver- tices and the number of edges. Table1 sum- marizes the connectivity between vertices, edges, faces, and cells of a k-simplex mesh. If a k-simplex mesh is (k + 1)-connected, all (k + 1)-connected meshes are not necessary simplex meshes.... ..."

### Table 1 describes the relation between faces of a k simplex mesh #28k #14 2#29 and the simplices

1994

"... In PAGE 8: ... Table1 : Dualitybetween triangulations and simplex meshes 1-triangulation and 1-simplex mesh are 2-connected chains or contours. They have re- markable topological properties.... ..."

Cited by 56

### Table 1 describes the relation between faces of a k simplex mesh (k 2) and the simplices of a k-triangulation.

1994

"... In PAGE 7: ... Table1 : Duality between triangulations and simplex meshes 1-triangulation and 1-simplex mesh are 2-connected chains or contours. They have re- markable topological properties.... ..."

Cited by 56

### Table 13: The operators of the computer domain.

1994

"... In PAGE 51: ... Similarly, for it to be plugged in the device must be located with the reachofapower outlet. Table13 shows the operators for this domain. For this domain, Alpine generates the graph shown in Figure 10.... ..."

Cited by 5

### Table 2 Updating the simplex.

1991

"... In PAGE 13: ... (The pointer source and the scalar i associated with the vertex vi are local to each processor and are assigned during the initialization of the template.) With this additional infor- mation, updating S to produce S+ is straightforward, as seen in Table2 . Note that before we update S, we check to see if fv produced the strict decrease we require.... ..."

Cited by 101

### Table: lt; gt; == Simplex

1993

Cited by 4

### Table: lt; gt; == Simplex

1993

Cited by 4

### Table: lt; gt; == Simplex

1993

Cited by 4