### TABLE 1: CONVERGENCE PERFORMANCE AND APPROXIMATION ERROR

2007

### Table 4. Algorithms for initializing and updating the minimal decomposition path

2005

"... In PAGE 10: ... In the remainder of the section, we present some algorithms for finding and updat- ing the minimum cost decomposition path. A summary of such algorithms is given in Table4 where I and U are respectively used for initialization and update. 6.... ..."

Cited by 1

### Table 1. Benchmarks: This table shows the performance of our algorithm on different models. The columns on the left show the statistics of the two primitives whose Minkowski sum is computed. They show the number of triangles in each primitive and the number of convex pieces generated by convex decomposition. The column, Num Convex Prims, shows the number of convex Minkowski sums generated. The right three columns show the time taken to generate the convex Minkowski sums, sampling (grid generation) and isosurface reconstruction.

2004

"... In PAGE 8: ...2 Performance We tested our algorithm on a number of complex models. The model complexity ( Table1 ) varied from several hun- dred to few thousand triangles. Figures 1 and 4 show the offset of three models: Bunny, Cup and Gear.... In PAGE 8: ...omplex features. Fig. 3 shows an application to motion planning. Table1 shows the model complexity and perfor- mance of our algorithm on these benchmarks. Sampling is the most time consuming step in the algorithm.... ..."

Cited by 8

### Table 10 Algorithms for initializing and updating the minimal decomposition path Phase Name Input Description

2006

"... In PAGE 8: ... Next, we present algorithms for finding and updating minimum cost decomposition paths and the data structures they use. A summary of the data structures is given in Ta- ble 9, while the algorithms are presented in Table10 where I and U are respectively used for initialization and update. 7 Data Structures In order to design efficient algorithms, we use FD-graph [4].... ..."

Cited by 3

### Table 5: Decomposition statistics: Algorithm II (smaller models, one processor)

"... In PAGE 6: ... The data for the smaller models grouped in tables 3 and 5 show that a convex decomposition is found in about 70% of the times the decomposition algorithm is called. Moreover, the average number of tours needed in a decomposition is quite small (Decomp cols in Table5 ) and violated cuts are produced... ..."

Cited by 1

### Table 4: Results of minimizing energy while meeting a performance constraint, for two different timing constraints, using the approximate and exact algorithms.

### Table 3: Preliminary results of our covering algorithms for minimizing average cycle-time. The \-WC quot; extension refers to the worst-case (balanced) decomposition of the circuit and the \-AC quot; extension refers to the optimized (average-case) decomposition.

1996

Cited by 22

### Table 1 Automatic parallelization of sequential convex hull algorithms Algorithm Number

2005

"... In PAGE 9: ... Consequently, the com- piler refused to generate a parallel version of these applications. Table1 summarizes the results. 5.... ..."