Excuse me sir, I think your answer is misleading. Based on other videos, I dont think we should ever ignore the V for finding D4 and D8. I believe we only ignore it when we want to find euclidian distance.
If the points ( x1 , y1 ) and ( x2 , y2 ) are in 2-dimensional space, then the Euclidean distance between them is sqrt{ ( x2 − x1 )^2 + ( y2 − y1 )^2}.
Bhai, ye saare answer bilkul correct hai. Aap galat jagah se pdh rhe h sayad. Aap standard books refer kr skte hai fir concept match kr skte h. And don't blame like this, its really hurting. Thanks.
Hi Shivendra, Both the questions are entirely different. Dekhiye, es question me hm sirf 4, 8 and m distances calculate kr rhe two pixels k beech me. But jo woods me question hai wo ye hai ki hme two pixels k beech me smallest 4, 8 and m path find krni h. Path V pr depend krta hai kyuki usi ka use krk hme decide krna h ki hm destination pixel pr reach kr rhe ki nhi so wha saare distances V pr depend krenge. But es video k question me hme sirf distances find krni h do pixels k beech me, aap woods me distances calculate krne k formulae ko dekh skte h. Hope it helps. Agr fir bhi koi doubt ho to, you plz let me know. Thanks.
The people like you are really awesome. You have no reason for the incorrect answer of this question, but still blaming. Well, thanks for commenting, it keeps my motivation very high.
