text: Whilst the complexity of the computation for rasterization scales linearly with number of triangles the complexity of a properly implemented ray tracing algorithm scales logarithmically; this is due to objects (triangles and collections of triangles) being placed into BSP trees or similar structures, and only being analyzed if a ray intersects with the bounding volume of the binary space partition.