I would appreciate some assistance on some coding.

The goal is to create this image:

It is a 2-dimensional array made of ones (size 100x100), and I need to set up a single 'for' loop with 100 iterations from row 1 to row 100, applying conditional statements inside the loop to generate the binary image.

There may be various ways to go by achieving my goal, the path I have chosen consists of me gathering all the points, and thus filling in the points.

Image below to show my progress:

So this led me to think of two questions. 1) Is it even possible for me to "fill" the points, and 2) Is there a better way to do this, and if so, could anyone supply me with the neccesary coding required?

Thanks. (p.s, this is being done on R2019A, but R2019B works just fine too)

[Steven Lord]

Can you show us the code you've written to try to solve the problem and describe the specific difficulty or difficulties you're having? If you do we may be able to provide some guidance and/or feedback on your code.

[Arslan Ahmed]

I am very new to Matlab, and so you may notice my attempts were cut short and I soon ran into difficulties.

The code currently is as follows:

I have attempted to use this, but I am not so sure how this would work in creating the various shapes in different positions, or how to utilise this code to answer my problems.

for j = 1:100
    A(j,j:100) = 1;
end

Answer 1

[Image Analyst]

If you have the vertex points, create the binary image

binaryImage = false(100, 100);

Then use poly2mask(x, y, 100, 100) to create binary images that you OR in with the first one.

oneRegion = poly2mask(x, y, 100, 100);
binaryImage = binaryImage | oneRegion;

Repeat for every closed square or triangular region using the x and y coordinates of that particular region.

[Arslan Ahmed]

Thank you for the quick reply, but unfortunately I had forgotten to mention that using the 'Image Processing Toolbox' is not prohibited for this task.

I have to use codes following similar formats to this: (This creates diagonal square 10x10 blocks going diagonally down to the right)

for j = 1:10
    A((1+10*(j-1)):(10*j),(1+10*(j-1)):(10*j)) = 1;
end
End
subplot(2,2,1)
imshow(A)

[Image Analyst]

So that must mean that it's your homework, which I'm not allowed to do for you to hand in, correct? You can't hand in my solution as your own, right? Please assign the tag of "homework" to it.

Yeah, you can continue to do assignments manually element-by-element like you're doing, if that's what your instructor requires.

[Arslan Ahmed]

No, the homework assignment had already been completed, this was the additional 'challenge' task which isnt compulsory. I had chosen to take up this challenge by myself, there is no set answer but I had assumed that for me to take on this task, I would have to use the knowledge gained from the previous tasks, which is where the confusion spurs as I do not see many possible routes for me to complete this non-compulsory task, with the knowledge I had learned.

[Image Analyst]

Are you allowed to use any built-in functions, such as tril(), find(), meshgrid(), or inpolygon()? If not, you're pretty much stuck doing it the tedious way, element-by-element where you have to check the coordinates and the region vertices and seeing if you're in the region to be drawn. You could write some of those functions yourself, like meshgrid() and do some clever things with thresholding to get certain regions, like pixels below or above a diagonal, or in a box.

[Arslan Ahmed]

I can attempt both, the tedious method aswell as using built-in functions. How would I go about doing it the tedious method? Is there some example coding you could potentially assist me with?

[Image Analyst]

Nothing that I have that is all ready to go and ready to hand over to you. I'd have to go through the same tedious exercise as you would, so I'll just leave that to you.