Very simple edge detection.

[Genbox]

Hi. I have a multidimensional integer array that represents the colors of a image: 0 0 1 0 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 0 1 0 0 0 (in this case, white = 0 & black = 1) This color map can vary in size, but I don't think that tributes to the solution here. What I need is a edge detection that detects only the side of the black image; 0 2 1 2 0 0 0 2 1 2 0 0 2 1 0 1 2 0 2 1 0 1 2 0 0 2 1 2 0 0 0 2 1 2 0 0 2 = detected edge, 1 = black, 0 = white. I was trying to traverse the hole color map, row by row, pixel by pixel on each side of the rectangle, and when a black color was found, the loop would break and save the position it was at, like this: textureData[,] - Contains the color map. for (int x = 0; x < texture.Width; x++) { for (int y = 0; y < texture.Height; y++) { if (textureData[x, y] != 0) { edgePoints.Add(new Point(x , y)); break; } } } This works for finding one side, but i can't seem to make a loop for other sides. Please help me.

[Luc Pattyn]

Hi, you should not break out of the for loop; instead you should record every transition: whenever 0 is followed by 1 you have a positive edge, whenever 1 is followed by 0 you have a negative edge. So the sequence 0 0 1 1 1 1 0 1 1 0 0 0 has two positive and two negative edges. You can apply this in any direction you want, typically you only need two directions (left->right and top->bottom). Of course a negative edge in left->right direction would be the same as a positive edge in right->left direction. Hope this helps :)

Luc Pattyn [My Articles] [Forum Guidelines]

[Genbox]

Yeah, that would make the detection more simple. Thanks.