Hi,
I want to write a pixel mapping program which performs like this (the image below is just so you know what the grid should look like):
(image from ladyada's SpokePOV project: www.ladyada.net/make/spokepov)
1. The home screen is a blank grid of segments. The segments are made by dividing a circle into sections
2. The user loads a monochrome (black and white) image, and the grid is overlaid onto the image
3. The program generates a boolean data array which says which grid segments contain part of the image
There are a number of aspects which I don't know how to address:
-How to draw a segmented circular grid with a 32-segment radius and 256
angular segments (in total there are 32 x 256 = 8192 segments)
-How to make an individual segment detect whether it contains part of the image or not
-How to efficiently generate a data table from the segments. For example, is individually checking the boolean values of the ~8200 pixels a good approach?
Thanks for any suggestions.