Content deleted Content added
m wording |
ABC image right-aligned |
||
Line 7:
Note that this approach has several problems. What happens when polygon A partly covers B, B partly covers C and C partly covers A again? It's not possible to decide which polygon is above the others. Or when two polygons intersect one another in three dimensions? The painter's algorithm will fail in these cases.
[[Image:Painters_problem.png|right|Image: how painter's algorithm fail]]
In its naive implementation, painter's algorithm can prove to be highly inefficient. It forces the system to dutifully [[render]] each point on every polygon in the visible set - even if that polygon is occluded in the finished scene. This means that, for detailed scenes, the painter's algorthm generally proves to be a slow solution.
| |||