### Table 1: Properties of Convex-Hull and Convex sets.

1994

"... In PAGE 2: ... 100]), meaning that the conventional Convex-Hull is indeed a particular case of the generalized Convex-Hull. Table1 shows that some of the basic properties of the Convex-Hull and of Convex sets are naturally extended to the B-Convex-Hull operation and to B-Convex sets.... ..."

Cited by 1

### Table 1: Time to compute the Convex Hull for n

1995

"... In PAGE 4: ... The actual imple- mentation allows us to examine some factors which cannot be determined solely by theoretical analysis. The results are shown in Table1 for sets from 50 to 20000 points in size. These points were obtained by randomly generating their x and y coordinates in the range 0 to 5000.... In PAGE 4: ... These points were obtained by randomly generating their x and y coordinates in the range 0 to 5000. The result in Table1 is obtained for each input size by taking the mean of the time to compute the convex hull points from over 60 di#0Berent random generated data sets. Since there is no built in clock for the WAVETRACER, the running time for each random generated data set is obtained by tim- ing 100 executions of the algorithm and then dividing by 100.... ..."

Cited by 7

### Table 1: Performance of the Convex Hull Volume implementation.

1998

Cited by 23

### Table 2: Performance of the Convex Hull Volume implementation.

1998

"... In PAGE 13: ... The machines used in the experiments are listed in table 1 along with their storage and speed speci cations. Table2 is copied from [ECS97] to show the performance of chD on inputs of varying degree of de- generacy. These experiments were carried out on a SparcStation 10/41 with the speci cations shown in table 1.... ..."

Cited by 23

### Table 2: Time in Seconds to compute the Convex Hull

1996

"... In PAGE 4: ... The performance of these two algorithms was compared to an associative algorithm based on the Graham Scan in #5B1,2#5D. In #5B1#5D, a graph based on Table2 indicate that these algorithms haveanaverage running time of O#28log n#29 or better.... ..."

Cited by 12

### Table 1: Performance of the Convex Hull Volume implementation.

1997

Cited by 1

### Table 3: A set of 12 points whose convex hull is not castable.

"... In PAGE 31: ...Table 3: A set of 12 points whose convex hull is not castable. According to an exhaustive checking of all possible planes through three vertices, the convex hull of the set of points given in Table3 is not castable. The points were generated at random, near the surface of a sphere.... ..."