![]() Heres a bunch of bonus images I made while I was programming it With this I can give it absolutely any vector field pattern (I have some other stuff I want to add, dipole, turbulence, etc) and it will be able to navigate any sorting interval across it. The "Max Length" option provides maximum number of intervals to take before it stops(in case it loops into itself and never terminates. Sorting starts at any pixel on this matte that is next to a black pixel and then from there it integrates all these vectors from the vector field to build up a path until it hits either a black pixel or the border of the image. The blue channel stores the black and white threshold mask for which all sorting is to take place. Instead what I do is I internally create an interal vector field in which each pixel's red and green channel encode a 2 dimensional direction vector. I kept the algorithm as "lossless" as possible by avoiding that. ![]() Such an affine transformation applied to an image would cause it to get very very garbled and "blurry". For arbitrary angles you could just rotate the image, sort it then rotate back ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |