Scribd
Upload
40 views

Image Space Algorithms

This document compares the complexity of image space algorithms and object space algorithms for 3D rendering. Image space algorithms have linear complexity based on the number of pixels and objects, making them more efficient than object space algorithms which have quadratic complexity based on the number of objects. However, object space algorithms are more functional because color calculations are done once and retained, whereas image space algorithms overwrite color calculations.

Uploaded by

musikmania
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
40 views

Image Space Algorithms

This document compares the complexity of image space algorithms and object space algorithms for 3D rendering. Image space algorithms have linear complexity based on the number of pixels and objects, making them more efficient than object space algorithms which have quadratic complexity based on the number of objects. However, object space algorithms are more functional because color calculations are done once and retained, whereas image space algorithms overwrite color calculations.

Uploaded by

musikmania
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

Image Space Algorithms Complexity = O(pixels * objects) e.g. 1286*1024 pixels and 1 million polygons Complexity = O(1.

(1.3 * 10^12) Object Space Algorithms Worst case might have to compare n objects with n-1 objects: Complexity = O(n^2) e.g. 1 million polygons Complexity = O(10^12)
Image space algorithms are much more efficient than object space algorithms Object space algorithms are much more functional than image space algorithms Color calculation in object space algorithms is done only one time and is retained by it but in image space algorithm the calculation once done is over written later.

You might also like