Interesting in-depth discussion with the parallel parentheses matching solution. Back to the clipping problem though, in each intermediate step (when we still

Interesting in-depth discussion with the parallel parentheses matching solution. Back to the clipping problem though, in each intermediate step (when we still incorporating prefixed results), do we compute clipping for each elements progressively (the result array in 1st pseudo-code snippet), or do we just compute the clipping boxes (the stack array snapshot in 1st pseudo-code snippet) and then compute the final clipping for each elements in parallel when the clipping boxes (position of each push & their bounding boxes) are ready? Sorry about my inaccurate terminology in advance as I didn't work closely with 2D graphics before.