Fill Algorithm

well when i read your post i thought you meant floodfilling, instead of filling a triangle.
in case you meant the floodfilling: dont use a recursive function! just have some sort of FIFO queue, add pixels/squares/stuff to be expanded (those around the pixel currently handled) to it, and repeat the same for those added to the list, until its empty.

Even the fill algorithm using a list takes too much time to fill. Which algorithm is used by popular softwares like Flash etc to instantly fill a closed region?
Please also provide the implementation...

Thanx a lot.

"A byte is a large bit to crunch!"

clear the pending list
#2
take the first point from the pending list
for each neighbour point that should be filled, add it to the pending list if it is nto already there
fill the current point
delete the current point from the pending list
while the pending list is not empty goto #2

Height Map Editor | Eternal Lands | Fast User Directory

so youre talking about filling a region with known borders? that indeed allows for much faster filling, but it can be slightly hard for some shapes. the general way is to just draw horizontal lines fitting the shape, but the way to find the x-coordinates of those lines varys with different shapes. what shape do you want to fill?

Flash is filling polygons, if I am not mistaken. There are plenty of articles on polygon filling out there. This is usually pretty fast.

Are you interested in Polygon filling, or flood fliling (like MS Paint?) This tends to be slower.

Cheers,
Will

Well I am certainly interested in Polygon Filling. Plz suggest me from where I can obtain relevant Information about this algorithm.

Thanx a lot.

"A byte is a large bit to crunch!"

divide the poly into triangles. (simple for convex polys_

for a triangle sort the points by the y and fill along scanlines

you can probably find tons of info on this subject on google, but the above is the general idea.