| ▲ | finghin 5 hours ago |
| In practice isn’t a large HashMap best for lookup, based on compile-time or static constants describing the character-space? |
|
| ▲ | spuz 5 hours ago | parent [-] |
| In the appendix, he talks about reducing the lookup space by quantising the sampled points to just 8 possible values. That allowed him to make a look up table about 2MB in size which were apparently incredibly fast. |
| |
| ▲ | finghin 5 hours ago | parent [-] | | I've been working on something similar (didn't get to this stage yet) and was planning to do something very similar to the circle-sampling method but the staggering of circles is a really clever idea I had never considered. I was planning on sampling character pixels' alignment along orthogonal and diagonal axes. You could probably combine these approaches. But yeah, such an approach seemed particularly powerful for the reason you could encode it all in a table. |
|