News for hackers. Stuff that matters.

A comment on Using k-d trees to efficiently calculate nearest neighbors in 3D vector space.

Re:Using k-d trees to efficiently calculate nearest neighbor... by im3w1l on Saturday February 10, 2018 @06:59PM (#16350347)
Which leads us to dithering
[ Parent | on HN ]
Re:Using k-d trees to efficiently calculate nearest neighbor... by agumonkey on Sunday February 11, 2018 @10:16AM (#16352979)
I can't find it right now but there was a lovely article on old ways and new ways to dither.

other articles:

- https://news.ycombinator.com/item?id=11886318

- https://www.cs.princeton.edu/courses/archive/fall00/cs426/le...

- https://hbfs.wordpress.com/2013/12/31/dithering/#more-4980

[ Parent | on HN ]