### Table 1 Topological relations implemented

1995

"... In PAGE 5: ... We followed the same procedure for the relations meet and overlap. Table1 shows the conclusions that can be drawn if we use the concept of projections to study topological relations. For each relation, the Table illustrates the subset of the 169 MBR configurations that could contain objects that satisfy the relation.... In PAGE 7: ... In that case, the distinction between the not_disjoint relation and the actual topological relation to be retrieved can be made during the refinement step. The cost of this approach is roughly equivalent to the cost of meet (according to Table1 , meet involves the retrieval of almost all MBRs that are not disjoint with the reference MBR). Depending on the relation and the MBR size, our approach can improve the performance by up to 60%.... In PAGE 8: ... In the previous query (relation in), the MBRs of the result are the same as those that would be retrieved if the relation of interest were covered_by. This is because the MBRs to be retrieved for inside constitute a subset of the MBRs for covered_by (see Table1 ). Figure 12 illustrates the subset relations with respect to the output MBRs.... In PAGE 10: ... In addition to the configurations of Table 1, the candidate MBRs for the first step may also satisfy the first- and second-degree conceptual neighbour relations with respect to the crisp MBRs that would be retrieved. Table 5 should be used instead of Table1 in such cases. The dark grey rectangles of Table 5 correspond to the... In PAGE 10: ... Table 5 should be used instead of Table 1 in such cases. The dark grey rectangles of Table 5 correspond to the crisp MBR relations displayed in Table1... ..."

Cited by 102

### Table 1 Topological relations implemented

1995

"... In PAGE 5: ... We followed the same procedure for the relations meet and overlap. Table1 shows the conclusions that can be drawn if we use the concept of projections to study topological relations. For each relation, the Table illustrates the subset of the 169 MBR configurations that could contain objects that satisfy the relation.... In PAGE 7: ... In that case, the distinction between the not_disjoint relation and the actual topological relation to be retrieved can be made during the refinement step. The cost of this approach is roughly equivalent to the cost of meet (according to Table1 , meet involves the retrieval of almost all MBRs that are not disjoint with the reference MBR). Depending on the relation and the MBR size, our approach can improve the performance by up to 60%.... In PAGE 8: ... In the previous query (relation in), the MBRs of the result are the same as those that would be retrieved if the relation of interest were covered_by. This is because the MBRs to be retrieved for inside constitute a subset of the MBRs for covered_by (see Table1 ). Figure 12 illustrates the subset relations with respect to the output MBRs.... In PAGE 10: ... In addition to the configurations of Table 1, the candidate MBRs for the first step may also satisfy the first- and second-degree conceptual neighbour relations with respect to the crisp MBRs that would be retrieved. Table 5 should be used instead of Table1 in such cases. The dark grey rectangles of Table 5 correspond to the... In PAGE 10: ... Table 5 should be used instead of Table 1 in such cases. The dark grey rectangles of Table 5 correspond to the crisp MBR relations displayed in Table1... ..."

Cited by 102

### Table 1. Topological relationships created from four intersections

1995

Cited by 13

### Table 1: Taxonomy of the topological details for selective re- finement schemes

2001

"... In PAGE 2: ... 2.3 Limitation of Previous Schemes Table1 summarizes the selective refinement schemes for pro- gressive meshes. Although topological details differ from each other, previous schemes share a common factor.... ..."

Cited by 7

### TABLE V DROP IN MAX LINK STRESS AND AVERAGE EXPECTED HOP DISTANCE, AS THE TRAFFIC SHIFTS FROM UNIFORM TO INTRACLUSTERED.

### Table 1: Possible values of F m according to topological relations.

2004

"... In PAGE 7: ... The content measure, however, is unable to capture metric refinements of meet relations. Fig- ure 8 shows the values of F m according to the topological relations of Table1 . In this Figure, curves bound the topological relations inside and contains, which were exper- imentally determined by using extreme cases and defining their respective parametric equations.... ..."

Cited by 1

### Table 1. Topologies of noise HMMs. Noise Topology

### Table 4: Evaluation of the topologies

"... In PAGE 6: ... Eachof the topologies is thenevaluated inordertodetermine the best topology. Table4 shows the evaluation results for the receiver and transmitter topologies. It is seen that each sized circuit meets... ..."

### Table 2: Topological Properties

1994

"... In PAGE 3: ... Notice that the star topology is merely the limiting case of the m-tree topology with d = 1 and m = n. These results are summarized in Table2 . For later com- parisons, we now compute the resource usages of multi- cast and simultaneous unicasts.... ..."

Cited by 18