Hello! I'm trying to use Wolfram to code a way to resize a pixel drawing that is stretched out to a larger scale over to the original pixel accurate size. I am trying to do this by identifying points and nearest neighbor paths to identify the pixel width and height and then sort the paths to find the smallest one in case of any multiple pixel groupings and then my approach is to take that distance and divide the original image size by the distance. I have a script that I already started but I am not figuring out the next step which is sorting The Edge lengths of the nearest neighbor calculation. Can somebody help me figure this out?
Attachments:
