hw8 recupero consigli

Question

Buonasera, se mi potreste dare qualche consiglio di come iniziare il HW8 di recupero?

Vi ringrazio tanto

Answer 1

I would suggest:

1_ loop through the image and whenever you find a pixel whose color is different from the background color, add 4 to the counter(since each pair of lines split the image into 4 parts) and then go through the pair of lines and delete them . Like this the counter will represent number of patches

for the second part where you have to recursively get the colors of lines and arrange them in n*1 image , I'm still thinking about it, Sorry ,>

Comments

Thank you so much Jad, I'm also thinking about the 2d part, I'll write you when I reach the answer

---

did you find a solution for the second part of the problem? i'm still struggling a bit :/

---

for the second part where you have to return the list of the color hierarchy, I suggest recursively tracing all the lots using the recursive algorithm called 'post-order-traversal' on the internet you will find a lot of information about it. currently i have implemented it and it work but I still haven't been able to get it to work in cases where the lots have sides shorter than 2 pixels. To make the concept easier, try looking at the image as a quaternary tree. This algortim if well implemented, it will not only return the list of color hierarchy but also che patches count.

---

there shouldn't be any cases where the lots have sides smaller than 2 pixels, if i read the text correctly

---

you are right thanks. I hadn't read everything. in this case it also works for secret tests. Since I was assuming that in secret tests they would include sides shorter than 2

---

Did you build a binary tree in order to implement the algorithm?

---

No, it is not necessary, but remember that the image is not a binary tree, but a quaternary tree, the rules are still the same.

---

yeah sorry i meant tree, binary was not intended

---

what do u mean with "go through the pair of lines and delete them"?

---

CIao @lorenzo.m  ti ho scritto un messaggio 

Answer 2

You have the BIG SPLITTING LINE. This will split the patch into 4 sections. now inside each section starting from section 4 ,you look if there exist another relatively big splitting line. If so, you repeat the process (i.e, recursion).

This is how I would approach part 2 of the HW, hope it works for you
 

Comments

I tried it and in my case it was too slow