Is there a specific sorting algorithm that works best with the painter's algorithm or will any be able to suffice?
Staffyirenng
@JustinHuey1 Using Binary Space Partition trees are one way to provide the necessary sorted order efficiently with changing viewpoint. We don't usually cover BSP trees specifically in class, but we do cover related topics later, including BSP trees and KD trees.
As a technical footnote, there were many algorithms studied in early computer graphics for hidden surface removal (which is the general version of the problem addressed by the Painter's Algorithm).
Is there a specific sorting algorithm that works best with the painter's algorithm or will any be able to suffice?
@JustinHuey1 Using Binary Space Partition trees are one way to provide the necessary sorted order efficiently with changing viewpoint. We don't usually cover BSP trees specifically in class, but we do cover related topics later, including BSP trees and KD trees.
As a technical footnote, there were many algorithms studied in early computer graphics for hidden surface removal (which is the general version of the problem addressed by the Painter's Algorithm).