3 ms·
> I can't see how an algorithm to lookup bit 'i' in a compressed bitmap of size 'n' can ever be constant time. Well for lossy compression we can, texture compr
by jobigoud 9y ago
> I can't see how an algorithm to lookup bit 'i' in a compressed bitmap of size 'n' can ever be constant time.
Well for lossy compression we can, texture compression works this way. Every 4x4 block or whatever block size is compressed to a fixed known length like 128 bits. Then you can address any pixel in constant time.