### Table 6 : Comparison of Complex Surface Methods

"... In PAGE 5: ... 43 Table 3: Determining Silhouettes. 47 Table 4: Computational Requirements 54 Table 5: Display Rate Requirements 55 Table6 : Comparison of Complex Surface Methods 56 ... ..."

### Table 4: Complexity of the surface meshes visualized in the experiments. The number of vertices and faces is given.

2004

Cited by 23

### Table 4: Complexity of the surface meshes visualized in the experiments. The number of vertices and faces is given.

2004

Cited by 23

### Table 5 Surface contents of complex concept B

1980

Cited by 1

### Table 2: Surface complexities and B-spline fit errors.

1996

"... In PAGE 7: ...successive steps, as obtained on a 105 MHz HP 735 workstation. Table2 lists for each example the complexities of the initial mesh M0 and the base complex K4. It also shows the fit errors of both the initial B-spline surface (Step 4) and the adaptively refined B- spline surface (Step 5), giving both rms and maximum errors as percentages of the object diameter.... ..."

Cited by 114

### Table 2: Surface complexities and B-spline fit errors.

1996

"... In PAGE 7: ...successive steps, as obtained on a 105 MHz HP 735 workstation. Table2 lists for each example the complexities of the initial mesh M0 and the base complex K4. It also shows the fit errors of both the initial B-spline surface (Step 4) and the adaptively refined B- spline surface (Step 5), giving both rms and maximum errors as percentages of the object diameter.... ..."

Cited by 114

### Table 2: Surface complexities and B-spline fit errors.

"... In PAGE 7: ...successive steps, as obtained on a 105 MHz HP 735 workstation. Table2 lists for each example the complexities of the initial mesh M0 and the base complex K4 . It also shows the fit errors of both the initial B-spline surface (Step 4) and the adaptively refined B- spline surface (Step 5), giving both rms and maximum errors as percentages of the object diameter.... ..."

### Table 3: Combinatorial bounds on the maximum complexity of the vertical decomposition of n surfaces. In the second row, K is the combinatorial complexity of the arrangement.

2000

Cited by 52

### Table 1: Physical simulation timings using both an explicit and an implicit solver versus the variation of surface complexity.

1999

"... In PAGE 6: ... 9). We have examined the timings achievedfor the physicalsimulation usingvarious configurationsof the control points and the discretized mesh (see Table1 ). Theoret- ically, the timing achieved is on the order of O#28s + m + c#29 where... ..."

Cited by 1