继续求助,继续给分,还是种子填充的问题.

2003-06-30 07:32:54 72 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

lihobby 墨衍会员 · AI 创作全网分发关注 + 加入社区

连通域分析之种子填充法连通域分析之种子填充法阅读详情

种子填充算法的递归实现
填充区域可以是多边形区域也可以是圆形区域.
用C 语言描述的数据结构写这个程序,要详细点谢谢谢谢!!!

...全文

漫水填充算法漫水填充算法描述 1.1、种子填充算法种子填充算法是从多边形区域内部的一点开始，由此出发找到区域内的所有像素。种子填充算法采用的边界定义是区域边界上所有像素具有某个特定的颜色值，区域内部所有像素均不取这一特定颜色，而边界外的像素则可具有与边界相同的颜色值。具体算法步骤：（1）标记种子（x,y）的像素点（2）检测该点的颜色，若他与边界色和填充色均不同，就用填充色填充该点，否则不填充（3 阅读详情

lihobby

数据结构与算法 33,027 成员 35,334 内容

+ 关注 + 加入社区

切换为时间正序

BlueSky2008 2003-06-30

打赏
举报

计算机图形学书上不都有吗？

寻开心 2003-06-30

打赏
举报

这个例子是填充一个矩形，对于其它形状的只要修改边界检查条件就可以了。

寻开心 2003-06-30

打赏
举报

/*
* fill.c : simple seed fill program
* Calls pixelread() to read pixels, pixelwrite() to write pixels.
*/

typedef struct { /* window: a discrete 2-D rectangle */
int x0, y0; /* xmin and ymin */
int x1, y1; /* xmax and ymax (inclusive) */
} Window;

typedef int Pixel; /* 1-channel frame buffer assumed */

Pixel pixelread();

typedef struct {short y, xl, xr, dy;} Segment;
/*
* Filled horizontal segment of scanline y for xl<=x<=xr.
* Parent segment was on line y-dy. dy=1 or -1
*/

#define MAX 10000 /* max depth of stack */

#define PUSH(Y, XL, XR, DY) /* push new segment on stack */ \
if (sp<stack+MAX && Y+(DY)>=win->y0 && Y+(DY)<=win->y1) \
{sp->y = Y; sp->xl = XL; sp->xr = XR; sp->dy = DY; sp++;}

#define POP(Y, XL, XR, DY) /* pop segment off stack */ \
{sp--; Y = sp->y+(DY = sp->dy); XL = sp->xl; XR = sp->xr;}

/*
* fill: set the pixel at (x,y) and all of its 4-connected neighbors
* with the same pixel value to the new pixel value nv.
* A 4-connected neighbor is a pixel above, below, left, or right of a pixel.
*/

fill(x, y, win, nv)
int x, y; /* seed point */
Window *win; /* screen window */
Pixel nv; /* new pixel value */
{
int l, x1, x2, dy;
Pixel ov; /* old pixel value */
Segment stack[MAX], *sp = stack; /* stack of filled segments */

ov = pixelread(x, y); /* read pv at seed point */
if (ov==nv || x<win->x0 || x>win->x1 || y<win->y0 || y>win->y1) return;
PUSH(y, x, x, 1); /* needed in some cases */
PUSH(y+1, x, x, -1); /* seed segment (popped 1st) */

while (sp>stack) {
/* pop segment off stack and fill a neighboring scan line */
POP(y, x1, x2, dy);
/*
* segment of scan line y-dy for x1<=x<=x2 was previously filled,
* now explore adjacent pixels in scan line y
*/
for (x=x1; x>=win->x0 && pixelread(x, y)==ov; x--)
pixelwrite(x, y, nv);
if (x>=x1) goto skip;
l = x+1;
if (l<x1) PUSH(y, l, x1-1, -dy); /* leak on left? */
x = x1+1;
do {
for (; x<=win->x1 && pixelread(x, y)==ov; x++)
pixelwrite(x, y, nv);
PUSH(y, l, x-1, dy);
if (x>x2+1) PUSH(y, x2+1, x-1, -dy); /* leak on right? */
skip: for (x++; x<=x2 && pixelread(x, y)!=ov; x++);
l = x;
} while (x<=x2);
}
}

继续求助,继续给分,还是种子填充的问题.

相关推荐