/explore
|
You are here 
|
hbfs.wordpress.com | ||
| | | | |
blog.demofox.org
This post explains how to use sliced optimal transport to make blue noise point sets. The plain, well commented C++ code that goes along with this post, which made the point sets and diagrams, is at https://github.com/Atrix256/SOTPointSets. This is an implementation and investigation of "Sliced Optimal Transport Sampling" by Paulin et al (http://www.geometry.caltech.edu/pubs/PBCIW+20.pdf).?They also have... |
|
| | | | | ||
| | | | |
www.euccas.me
[AI summary] This technical article provides a comprehensive in-depth explanation of the zlib library, covering its internal implementation of the deflate algorithm (LZ77 and Huffman encoding), I/O buffering strategies, and various performance optimizations from companies like Intel, Google, and Facebook. |
|
| | | | | ||
| | | | |
wiki.nesdev.com
Tile compression refers to techniques that allow fitting more graphics data into a smaller space. Programs using CHR ROM cannot use compressed tiles, as their tile data must be stored in the PPU's native format. But programs using CHR RAM can process tile data while copying it from PRG ROM to CHR RAM, and this processing allows storing more tiles in the same space. |
|
| | | | | ||
| | | | |
www.sirver.net
[AI summary] The article explains the properties, structure, and performance benchmarks of Red-Black trees, comparing them favorably to Binary Search Trees and AVL trees for balanced data storage. |
|
| | | |||
