--Mid point subdivision algorithm is used to find visible area of line on clipping widow( clipping window is that portion of picture or image that we want to view). --This method is based on bisection method i.e we calculate mid value of a line by adding end points of line and then dividing that line by 2. suppose p1(x1,y1) and p2(x2,y2) are points of line p1 and p2 then mid value is Pm=((x1+x2)/2,y1+y2)/2) so new line is p1pm and pmp2 --again we check if their end points are in visible are of clipping window.if not we further divide p1pm into two line segments i.e p1pm1 andpm1pm --this procedure will continue until all segments are either visible or invisble totally --if any segment is partially visble then we continue with process again
a note on numerically unstable algorithm
dijkstra's algorithm (note* there are different kinds of dijkstra's implementation) and growth graph algorithm
To find the midpoint of two real numbers add them together and then divide by two: (15.30+12.15 )/2 = 27.45/2 = 13.725 To double check that 13.725 is in fact the midpoint note that 13.725 is the same distance (1.575) from each of the numbers.
The Reverse Delete Algorithm for finding the Minimum Spanning Tree was first introduced by Edsger Dijkstra in 1959. He presented this algorithm in his paper titled "A note on two problems in connexion with graphs" which was published in Numerische Mathematik.
write a short note on inscriptions
Short note on dehli proposal
short note on "League of Nation"
short note on GAAP
short note on practice
Short Note - album - was created in 1981-01.
write a short note on windows?
write a short note of west Bengal