Today I spent my time finishing off the back faced culling and sorting. I created the "calculate backfaces" method to the Model class which sets the cull value to true or false. After this was applied and was working I applied the method to sort polygons by z depth. The reason for this is to assure that the furthest back polygons are drawn first, and the closest are drawn on top of them. C++ has a built in <algorithm> package that uses quick sort organise collections. with this I had to implament a > operator as the iterator did not know which value to compare in the instance.
Today I spent my time finishing off the back faced culling and sorting. I created the "calculate backfaces" method to the Model class which sets the cull value to true or false. After this was applied and was working I applied the method to sort polygons by z depth. The reason for this is to assure that the furthest back polygons are drawn first, and the closest are drawn on top of them. C++ has a built in <algorithm> package that uses quick sort organise collections. with this I had to implament a > operator as the iterator did not know which value to compare in the instance.
Comments
Post a Comment