|
|
|
|
|
|
by enriquto
678 days ago
|
|
|
> compute the non-overlapping areas of each polygon within each pixel In the given example (periodic checkerboard), that would be impossible because the pixels that touch the horizon intersect an infinite amount of polygons. Not that TFA solves that problem either. As far as I know the exact rendering of a periodic pattern in perspective is an open problem. |
|
|