Content deleted Content added
Hangandrew (talk | contribs) →Other computer graphics algorithms: Removed beginning sentence. Will create See also section |
Hangandrew (talk | contribs) m Added citation |
||
Line 34:
The algorithm can fail in some cases, including cyclic overlap or piercing polygons.
=== Cyclical Overlapping ===
In the case of cyclic overlap, as shown in the figure to the right, Polygons A, B, and C overlap each other in such a way that it is impossible to determine which polygon is above the others. In this case, the offending polygons must be cut to allow sorting.<ref name=":0" />
=== Piercing Polygons ===
The case of piercing polygons arises when one polygon intersects another. Similar
=== Efficiency ===
| |||