Mam I'm watching all of your videos on visible surface detection. Clearly explained mam. A slow learner can understand it in single time. Good Job mam and thank you mam
Mam can you please try for another subjects too mam you are the best in teaching mam and IAM not able to understand clearly when others are teaching please give videos for other subjects mam
View reference is changing used then. Objects or surface is considered as a space, partitioned using a partition plane. After partitions we have to find what all object are in front of partition plane or in the back. To show that we need to draw a tree, that tree is known as BSP. When you are talking of binary tree, for each node of a tree consists of max two branches/node attached to it. Now let's understand this with an example using a diagram. Let's consider three objects in a space. Then consider a partitioning plane P1, partitioning the space such that it intersects an object. So the object is divided into two parts where A & C is considered as front of partitioning plane P1 and B&D as in back. ---this is shown using binary tree Front and back are considered nodes. Front is the left edge and vice versa Partitioning plane P1 consider as root. Process all the nodes in the front first A&C is in the left node and vice versa Consider A as next parent node "of the front" where C is on the left node And vice versa for back. This is how bsp is done, this requires hardware which is very costly so that's why it's not opted often
Mam I'm watching all of your videos on visible surface detection. Clearly explained mam. A slow learner can understand it in single time. Good Job mam and thank you mam
Stop using the word mam.
@@TheChrisey
If you don't like my comment just move on. Don't consider it
@@kabilr1820 No, if I don't like your comment then I'll comment on that. :)
@@TheChrisey haha
@@TheChrisey stop bullying him please, he is being pollite.
U have done a great job mam thanks for ur videos mam videos are making me to learn clear and easy
Mam can you please try for another subjects too mam you are the best in teaching mam and IAM not able to understand clearly when others are teaching please give videos for other subjects mam
thank you mam, i understand everything 😊
View reference is changing used then.
Objects or surface is considered as a space, partitioned using a partition plane.
After partitions we have to find what all object are in front of partition plane or in the back.
To show that we need to draw a tree, that tree is known as BSP.
When you are talking of binary tree, for each node of a tree consists of max two branches/node attached to it.
Now let's understand this with an example using a diagram.
Let's consider three objects in a space.
Then consider a partitioning plane P1, partitioning the space such that it intersects an object.
So the object is divided into two parts where A & C is considered as front of partitioning plane P1 and B&D as in back.
---this is shown using binary tree
Front and back are considered nodes.
Front is the left edge and vice versa
Partitioning plane P1 consider as root.
Process all the nodes in the front first
A&C is in the left node and vice versa
Consider A as next parent node "of the front" where C is on the left node
And vice versa for back.
This is how bsp is done, this requires hardware which is very costly so that's why it's not opted often
Good explanation
Very nice 🙏🙏🙏🙏🙏🙏☺️
Very easy to understand
Awesome! Thank you so much
Nice mam
Very nice
where did you find p1 and p2 ? we have to select any polygon surface as partition plate.
where is the viewing direction?
Why dont you people use real examples to make videos, rather than with whiteboards and sharpies, all this knowledge needs to be applied practically.
U can start doing that from your end...All the best.
@@JyothiMandala
GOOD EVENING MADAM,I am watching some videos your teaching very fast .who didn't get any poor students
plz change the your teaching style