You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Oct 8, 2024. It is now read-only.
Now, gif-for-cli still uses a predefined constant . ,\'-:;!" ^/+? *&8#$@% to match the brightness and generate the image, like all similar tools do. This approach does not make effective use of all the visible characters in the ASCII character set, and some uneven symbols like ^ and , would give the output image a "broken" feel.
Perhaps we can introduce a kind of "oversampling" method: since the input is a bitmap, we could also divide the glyph of each character into 𝑛² pieces (say 4 or 9 pieces), and compare in the scaled original image for an equally sized area. By using an optimized 𝑘-d tree (𝑘 = 𝑛²), the single most accurate character can be found instantly for each 𝑛² pixels. This would be a major improvement for gif-for-cli.
I have written an example implementing this idea for reference (strear/saam), but its code is in C++. Do the maintainers and the pull request people have any good ideas on how to merge this implementation in?
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Now, gif-for-cli still uses a predefined constant
. ,\'-:;!" ^/+? *&8#$@%
to match the brightness and generate the image, like all similar tools do. This approach does not make effective use of all the visible characters in the ASCII character set, and some uneven symbols like^
and,
would give the output image a "broken" feel.Perhaps we can introduce a kind of "oversampling" method: since the input is a bitmap, we could also divide the glyph of each character into 𝑛² pieces (say 4 or 9 pieces), and compare in the scaled original image for an equally sized area. By using an optimized 𝑘-d tree (𝑘 = 𝑛²), the single most accurate character can be found instantly for each 𝑛² pixels. This would be a major improvement for gif-for-cli.
Original: http://9front.org/img/9iknowthis01.png
I have written an example implementing this idea for reference (strear/saam), but its code is in C++. Do the maintainers and the pull request people have any good ideas on how to merge this implementation in?
The text was updated successfully, but these errors were encountered: