Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Exact, parallel 2D Delaunay triangulation for int32 coordinates.
Looking at his performance graph it looks like he does about 1 million points in around 320ms or so (if I managed to read his graph correctly), albeit for float2 values and using Unity Burst which does SIMD+multiple threads.
There are no comments on this comment yet.
Looking at his performance graph it looks like he does about 1 million points in around 320ms or so (if I managed to read his graph correctly), albeit for float2 values and using Unity Burst which does SIMD+multiple threads.