** Next:** Final Analysis
** Up:** Analysis
** Previous:** Computing Platform
** Contents**

####
A noticeable feature of the graph shown in Figure
is that the number of vertices removed per second
decreases as the model size increases. This is because the computational
complexity of our algorithm is not linear. The results imply that the
computational complexity is . This is proven when we examine the
algorithm. The decimation process, in the most severe case of considering every
vertex for removal, iterates through each vertex in the model once (
iterations). While considering it for removal and retriangulating, it could, in
the worst case, iterate through the list of all vertices in the model a constant
number of times (total of iterations). is
; thus, the complexity of our program is .

** Next:** Final Analysis
** Up:** Analysis
** Previous:** Computing Platform
** Contents**
Tim Garthwaite
2002-02-03