I am currently reading the pdf regarding Memory-Efficient Order-Independent Transparency with Dynamic Fragment Buffer.
in there it is proposed to do two steps before sorting the fragments:
First, for each fragment you simply increment a counter to determine how many fragments occupy that pixel.
Second, lists are created by calculating a base into a buffer and store the fragment data relative to that base. my question is :
how is that buffer sized/generated? how can i create a buffer that exactly stores what it needs?

The counting buffer is a simple RWStructuredBuffer that contains the counter and the base address and has as many elements as width x height. but i don't understand how the lists are generated.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.