Fig. 4

The data flow in the extension. a The first pass of the extension. We render two moving triangles at t = 0 and t = 1 and then use two positions of each triangle to make a prism. The output of this pass is a nearest map. b The second pass of the extension. We render these two triangles again at t = 0 and t = 1. Using the nearest map, we find overlapping pixels between two positions of each triangle and then mark the overlapping pixels in a coverage map. c The third pass of the extension in the top view. Since the blue triangle does not continuously cover the yellow pixel, we remove a value stored at this pixel in the coverage map