Modified Boundary Fill

    private void fillTri(int x, int y, int param[]) {
        /*
            pixel inside bounding box?
        */
        if ((x > xMax) || (x < xMin)) return;
        if ((y > yMax) || (y < yMin)) return;
		
        /*
            pixel inside triangle?
        */
        if ((param[0]|param[1]|param[2]) < 0) return;

        /*
            compute fill color
        */
        int pixa = (param[3] >> EdgeEqn.FRACBITS);
        int pixr = (param[4] >> EdgeEqn.FRACBITS);
        int pixg = (param[5] >> EdgeEqn.FRACBITS);
        int pixb = (param[6] >> EdgeEqn.FRACBITS);
        pixa = ((pixa & ~255) == 0) ? pixa << 24 : ((pixa < 0)	? 0 : 255<<24);
        pixr = ((pixr & ~255) == 0) ? pixr << 16 : ((pixr < 0)	? 0 : 255<<16);
        pixg = ((pixg & ~255) == 0) ? pixg << 8  : ((pixg < 0)	? 0 : 255<<8);
        pixb = ((pixb & ~255) == 0) ? pixb       : ((pixb < 0)	? 0 : 255);
        pixa = pixa | pixr | pixg | pixb;
        if (raster.getPixel(x, y) == pixa) return;
        raster.setPixel(pixa, x, y);

        /*
            fill 8 neighbors
        */
        param[0] += edge[0].A;        // REUSES param array
        param[1] += edge[1].A;        // ran out of stack space
        param[2] += edge[2].A;
        param[3] += alpha.A;
        param[4] += red.A;
        param[5] += green.A;
        param[6] += blue.A;
        fillTri(x+1, y, param);
        
        param[0] += edge[0].B;
        param[1] += edge[1].B;
        param[2] += edge[2].B;
        param[3] += alpha.B;
        param[4] += red.B;
        param[5] += green.B;
        param[6] += blue.B;
        fillTri(x+1, y+1, param);
        
        param[0] -= edge[0].A;
        param[1] -= edge[1].A;
        param[2] -= edge[2].A;
        param[3] -= alpha.A;
        param[4] -= red.A;
        param[5] -= green.A;
        param[6] -= blue.A;
        fillTri(x, y+1, param);
        
        param[0] -= edge[0].A;
        param[1] -= edge[1].A;
        param[2] -= edge[2].A;
        param[3] -= alpha.A;
        param[4] -= red.A;
        param[5] -= green.A;
        param[6] -= blue.A;
        fillTri(x-1, y+1, param);
        
        param[0] -= edge[0].B;
        param[1] -= edge[1].B;
        param[2] -= edge[2].B;
        param[3] -= alpha.B;
        param[4] -= red.B;
        param[5] -= green.B;
        param[6] -= blue.B;
        fillTri(x-1, y, param);
        
        param[0] -= edge[0].B;
        param[1] -= edge[1].B;
        param[2] -= edge[2].B;
        param[3] -= alpha.B;
        param[4] -= red.B;
        param[5] -= green.B;
        param[6] -= blue.B;
        fillTri(x-1, y-1, param);
        
        param[0] += edge[0].A;
        param[1] += edge[1].A;
        param[2] += edge[2].A;
        param[3] += alpha.A;
        param[4] += red.A;
        param[5] += green.A;
        param[6] += blue.A;
        fillTri(x, y-1, param);
        
        param[0] += edge[0].A;
        param[1] += edge[1].A;
        param[2] += edge[2].A;
        param[3] += alpha.A;
        param[4] += red.A;
        param[5] += green.A;
        param[6] += blue.A;
        fillTri(x+1, y-1, param);
        
        /*
            fix it up back to the way we found it (Why?)
        */
        param[0] += edge[0].B - edge[0].A;
        param[1] += edge[1].B - edge[1].A;
        param[2] += edge[2].B - edge[2].A;
        param[3] += alpha.B - alpha.A;
        param[4] += red.B - red.A;
        param[5] += green.B - green.A;
        param[6] += blue.B - blue.A;
    }
}
Lecture 8 Slide 21 6.837 Fall '98