0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
Line clipping can also be carried out for?
Line clipping can also be carried out for: Options Concave Polygon clipping windows Clipping window All of the these
What are the Disadvantages of Cohen Sutherland Line clipping algorithm?
It can only be used on a rectangular clip window.
Difference between boundary fill algorithm and scanline polygon fill algorithm?
in scan line polygon fill, each can line crossing a polygon, the area fill algorithm locates the intersection point of the scan line with the polygon edges. These intersection points are then stored from left to right and the corresponding frame buffer positions between each intersection painr are set to the specified fill color. In boundary fill, approach to area filling is to start at a point inside a region and paint the interior outward toward and the boundary.
Compare the scan line polygon fill with the boundary fill algorithm?
in scan line polygon fill, each can line crossing a polygon, the area fill algorithm locates the intersection point of the scan line with the polygon edges. These intersection points are then stored from left to right and the corresponding frame buffer positions between each intersection painr are set to the specified fill color. In boundary fill, approach to area filling is to start at a point inside a region and paint the interior outward toward and the boundary.
What are the limitation of Cohen sutherland line clipping algorithm?
â–º Clipping and testing are done in fixed order.â–º Efficient when most of the lines to be clipped are eitherrejected or accepted (not so many subdivisions).â–º Easy to program.â–º Most line segments are outside and can be eliminated
Compare scanline polygon fill with the boundary fill algorithm?
in scan line polygon fill, each can line crossing a polygon, the area fill algorithm locates the intersection point of the scan line with the polygon edges. These intersection points are then stored from left to right and the corresponding frame buffer positions between each intersection painr are set to the specified fill color.In boundary fill, approach to area filling is to start at a point inside a region and paint the interior outward toward and the boundary.
Difference between point clipping and line clipping?
olamba..........
What is the need of parallel line algorithm?
Do you mean "Why might a parallel line algorithm be needed?" or "What properties does a parallel line algorithm need to have?".
Which one of these is not a polygon a hexagon square triangle or line?
A line is not a polygon. A polygon is a closed figure with straight sides, while a line is a straight path with no endpoints.
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
Is a line a polygon?
No, a line is not a polygon. A polygon is a closed plane area bounded by straight sides. A line, by itself, does not contain an area.
A line segment that joins two vertices of a polygon but is not a side of the polygon?
………………………… is a line segment that joins two vertexof a polygon but is not a side of the polygon.
