answersLogoWhite

0


Best Answer

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.

User Avatar

Wiki User

14y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Difference between boundary fill algorithm and scanline polygon fill algorithm?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Difference between boundary fill and flood fill algorithm?

boundary fill fills boundary with one color and flood fill fills boundary with different color.


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.


What is the difference between AES Rijndael symmetric algorithm encryption and a hash algorithm?

678


What is difference between lemma and algorithm?

A Method that used to be a comouter to soultion of promlems is called algorithm.


What is the difference between an algorithm and a computer program?


What is the difference between a convergent plate boundary and a destructive plate boundary?

there the same


What is the difference between procedure and algorithm?

A procedure can go on forever.Where as an Algorithm, will eventually terminate and will have each step precisely defined.


Difference between greedy algorithm and dynamic programming?

the basic difference between them is that in greedy algorithm only one decision sequence is ever generated. where as in dynamic programming many decision sequences are generated.


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...


What is the difference between an algorithm and flow chart WITH examples?

An algorithm is a method of solving a problem. A flow chart is a tool for visualizing algorithms.


What is the difference between advanced encryption algorithm and encryption algorithm?

People have developed many encryption algorithms. One particular encryption algorithm is the Rijndael algorithm, usually called the AES or Advanced Encryption Standard.


What are the difference between greedy algorithm and dynamic programing?

A greedy algorithm is similar to a dynamic programming algorithm, but the difference is that solutions to the subproblems do not have to be known at each stage; instead a "greedy" choice can be made of what looks best for the moment.