0
Why is midpoint subdivision algorithm preferred over Cohen-Sutherland algorithm?
Wiki User
∙ 13y ago
The cohen sutherland algo requires calculation of intersection of the line with the window edge.This direct calculation is avoided by performing a binary search for the intersection by always dividing the line at its midpoint.To implement it a parallel architecture is used and hardware division addition by 2 is very fast
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
midpoint circle algorithm example in real life?
الزكاء الاصطناعي
Difference between Bresenham and midpoint circle drawing algorithm?
what is difference between mid-point and bresenhams circle algorithm what is difference between mid-point and bresenhams circle algorithm bresenhams circle algorithm results in a much more smoother circle,comparred to midpoint circle algorithm..In mid point,decision parameter depends on previous decision parameter and corresponding pixels whereas in bresenham decision parameter only depends on previous decision parameter...
Where is Dundee Subdivision in Omaha?
Dundee is a great older time area that is just north of Dodge that ranges a few miles, however, it is approximately at 40th Street & California Street- that is Dundee Downtown and a perfect midpoint.
What is midpoint postulate?
midpoint postulate
What does the midpoint formula give you the midpoint of?
it gives you the midpoint of the line segment you use the formula for
Why is midpoint called midpoint?
A midpoint of anything is the point exactly halfway between the beginning point and the end point. So logically, it is the "midpoint".
What in brooklyn has a midpoint?
The Brooklyn Bridge has a midpoint.
What is the midpoint of the circle?
It is its centre or the midpoint of its diameter.
What is the class midpoint?
midpoint between 4-16
What is the midpoint of this century?
2050
Point which divides a segment in half?
the answer is midpoint
Short note on midpoint subdivision algorithm?
--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
