Feb 14, 2014 I also explained a program in C language for 4. Boundary Fill Algorithm in Hindi Computer. Flood Fill algorithm in Computer Graphics. Empereur L Empire Du Milieu Cracker. Polygon Filling Algorithm. Learn about Computer Graphics in simple and easy terms starting from trends in Computer Graphics. The boundary fill algorithm can be.

Boundary Fill Algorithm Boundary Fill Algorithm Start at a point inside the figure and paint with a particular color. Filling continues until a boundary color is encountered. Thjere are two ways to do this: 1. Four-connected fill where we propagate: left right up down Procedure Four_Fill (x, y, fill_col, bound_col: integer); var curr_color: integer; begin curr_color:= inquire_color(x, y) if (curr_color bound color) and (curr_color fill_col) then begin set_pixel(x, y, fill_col) Four_Fill (x+1, y, fill_col, bound_col); Four_Fill (x-1, y, fill_col, bound_col); Four_Fill (x, y+1, fill_col, bound_col); Four_Fill( x, y-1, fill_col, bound_col); end; There is the following problem with four_fill: Thisd leads to the 2. Eight-connected fill algorithm where we test all eight adjacent pixels. So we add the calls: eight_fill (x+1, y-1..) eight_fill (x+1, y+1.) eight_fill (x-1, y-1..) eight_fill (x-1, y+1..) Note: above 4-fill and 8-fill algorithms involve heavy duty recursion which may consume memory and time. Seikoku No Ryuu Kishi Light Novel English.

Eight-connected fill algorithm where we test all eight adjacent pixels. So we add the calls: eight_fill (x+1, y-1.) eight_fill (x+1, y+1.) eight_fill (x-1, y-1.) eight_fill (x-1, y+1.) Note: above 4-fill and 8-fill algorithms involve heavy duty recursion which may consume memory and time.

Better algorithms are faster, but more complex. They make use of pixel runs (horizontal groups of pixels). Alternative Improved Algorithm 1. Fill in row with START pixel 2. Find RIGHTMOST pixel for line above first row - push on stack 3. Find RIGHTMOST pixel for line below first row - push on stack 4. Pop stack and goto 1 Repeat above until stack empty.

General Problem for boundary fill - requires a unique boundary color Might do (for 2 overlapping polys) but should be Note: if draw front poly 1st will get: Can use a unique color for boundary, e.g., use -- for boundary, then 1. Draw boundary in -- 2. Fill polygon 3. Redraw boundary in final color -- (requires extra color for temporary boundary color) Last changed May 13, 1998, G. Scott Owen, owen@siggraph. Zoids Saga Gba Rom English Patch. org.

I don't think you've given us quite enough context. It looks as though the code you show is supposed to fill a rectangle which has a boundary in colour b and other data that has to be in colour r at the end. The only constraint on the recursive calls is that boundary; otherwise, the code will merrily go outside the bounds of the rectangle with the ±1 operations. Presumably, your rectangle() function marks the boundary of the rectangle with WHITE — if it doesn't, your code is hosed. Is this the signature for rectangle(): void rectangle(int ll_x, int ll_y, int x_len, int y_len);? – Sep 27 '14 at 19:20 •. You're still providing minimal information — it doesn't help your cause.