Viewing profile — muyyatin2
muyyatin2
HN member- Joined
- Tue, Jan 18, 2022, 8:41 AM UTC
- HN karma
- 79
- Public activity
- 14 items
- HN profile
- View on Hacker News ↗
About muyyatin2
No profile information was provided.
Recent public activity
-
comment
Comment #41260752
I'm curious what your thoughts are on my approach for robustness. I've written similar operations[1] that include elliptical arcs AND Bézier curves, and robustness has been an issu…
-
comment
Comment #41260262
This is correct! My CPU implementation of this code can handle the overlapping polygons / meshes / textures. https://phetsims.github.io/alpenglow/#depthSort (takes forever to load,…
-
comment
Comment #41259974
The analytic approach to occlusion definitely does seem like a "humbling parallelism" type of problem on the GPU. My curiosity is leading me to explore it, and it may be reasonable…
-
comment
Comment #41253897
Ahh yes, for exact filtering it does need to be constant colour. I'm looking into seeing whether it can be done for gradients. However in practice, it works quite well visually to …
-
comment
Comment #41253885
It is more similar to the convolution of the shape with the filter (you can take the product of the filter, at various offsets, with the polygon) Essentially if you have a polygon …
-
comment
Comment #41253846
I ran across https://dl.acm.org/doi/pdf/10.1145/72935.72950 a few weeks ago, it seems like a potential non-sweepline highly-parallel method. I've had some promising results for fir…
-
comment
Comment #41253741
I've been looking into how viable this is as a performant strategy. If you have non-overlapping areas, then contributions to a single pixel can be made independently (since it is j…
- story
- story
- story
-
comment
Comment #35188680
Do you have some links/references for someone wanting to learn more about this?
- story
-
comment
Comment #30096376
I saw an analysis for a four-word blind combination, but I believe it didn't fully determine the word by the 5th guess: http://www.garytay.net/4-words-to-win-wordle-in-less-than-a-…
- story