7/31/2019 Poygon Filling Algorithm

1/15

1

7/31/2019 Poygon Filling Algorithm

2/15

2

7/31/2019 Poygon Filling Algorithm

3/15

3

suitable for interactive

painting applications

7/31/2019 Poygon Filling Algorithm

4/15

4

7/31/2019 Poygon Filling Algorithm

5/15

5

The procedure accepts as input the coordinatesof an interior point ( x, y), fill color and a

boundary color .

Starting from (x, y) the procedure tests

neighbouring positions to determine whether

they are ofthe boundary color.

If not paint them with fill colorand test their

neighbours and process continues until allpixels up to the boundary colorfor the area

have been tested.

7/31/2019 Poygon Filling Algorithm

6/15

6

There are 2 methods for proceedingto neighbouring pixels from thecurrent test positions.

4 connected method.

8 connected method.

7/31/2019 Poygon Filling Algorithm

7/15

7

7/31/2019 Poygon Filling Algorithm

8/15

8

7/31/2019 Poygon Filling Algorithm

9/15

9

7/31/2019 Poygon Filling Algorithm

10/15

10

7/31/2019 Poygon Filling Algorithm

11/15

11

7/31/2019 Poygon Filling Algorithm

12/15

12

7/31/2019 Poygon Filling Algorithm

13/15

13

7/31/2019 Poygon Filling Algorithm

14/15

14

7/31/2019 Poygon Filling Algorithm

15/15

15

Scan line Fill Approaches.

Fill an area by determining theoverlap intervals for scan lines thatcross that area.

- works at the polygon level- used in general graphics

packages tofill polygons, circles etc.

- better performance.