Piero Bosio Social Web Site Personale

@mirth Given the critical part here is the edges, the demonstration you propose doesn't help on this issue.
Then one solution could be compute bits at half-res where there isn't edges (so edges are at full res), but this sounds a bit like the MSAA or Variable rate solution that were proposed in other replies, they are unfortunately difficult to implement in my engine.

@mirth I will scratch my head a bit about it ;)

@mirth Hmm, I not sure I see how I could transcribe the effect into this method. What would be the point of making it separable it, outside of the performance cost ?

I use a 3x3 bilateral filter, each sample is weighted by both spatial distance (sub-pixel position within the half-res grid) and depth
similarity (to prevent light bleeding across silhouettes).

To illustrate a bit, In the worst-case scenario this is how it looks like:

@WaitForPresent Not doable with the framework I'm working with I believe, plus I'm sticking to OpenGL currently. Or I would need to emulate it myself in compute.

@blurple I haven't tried the checkerboard, but I tried different combination of bilinear and nearest filtering with custom weights. No luck so far.

@breakin Thank for sharing that idea still ! That's sounds interesting ! :)

@breakin I have the zbuffer yes, but I can't toy with msaa unfortunately. Here the issue is around edges of geometry, noise isn't a problem.

I'm not sure what I could do better, without temporal anti-aliasing. I'm open to suggestions ☺️

I render them at half resolution to save a bit on performance and keep it cheap. However I'm struggling to find a good upscale algorithm. Bilateral weights based on the differences on the depth buffer isn't enough.

I recently added a rendering pass in my engine to compute volumetric shapes via raymarching. Mostly to cast volumetric shadows with spot lights.