Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

2
  • I did this, my algorithm maps the border pixels into an array. I've tried just checking against every single one of them for the closest. Suprisingly, this actually works even though there are 2100 of them. You don't actually have to take the sqrt, becuase just adding (x1-x2)^2 + (y1-y2)^2 is enough information to determine which point is CLOSEST, you just don't know the actual distance. However, it runs a little funky. I've created an accuracy interval that lets me scale how many points on the border are actually mapped (leaving gaps inbetween them). Commented Nov 23, 2011 at 19:19
  • I think I could optimize the search if I stored the border points in the array in a contiguous order. Currently my mapping algorithm just scans the screen 1 pixel at a time checking if it has any directly adjacent white pixels, if it does, it's added to the array. This results in a rather scattered ordering of the points, but I could run through the array and re-order them based on contiguity. This would allow me to search from the pixel my original line-mapping method comes up with, and perhaps only search the nearest 100 border items, or something of that nature. Commented Nov 23, 2011 at 19:34