实验四 不规则区域的填充算法

实验题目：不规则区域的填充算法

实验目的：验证不规则区域的填充算法

实验内容：利用VC与OpenGL,实现不规则区域的填充算法。

1、必做：实现简单递归的不规则区域填充算法。

2、选做：针对简单递归算法栈空间占用太大的缺点，进行改进，实现基于扫描线的种子填充算法

实验要求：

将坐标系网格在屏幕上画出来，每个像素点占据一个格点，用一个小实心圆圈表示。

用鼠标点击的方式，绘制不规则区域的边界。

种子填充算法，可用4联通或8联通任选一种。

-Filling algorithm experiment four irregular region

Experimental subjects: irregular region filling algorithm

Purpose: Verify that the irregular region filling algorithm

Experiment: Use VC and OpenGL, irregular region filling algorithm realization.

1, will do: simple recursive irregular region filling algorithm.

2, choose to do: take up too much stack space algorithm for simple recursive shortcomings, to improve, to achieve seed filling algorithm based on scan line

Experimental requirements:

The coordinate grid drawn on the screen, each pixel occupies one lattice point, by a small filled circle.

Use the mouse to click on a way to draw irregular border region.

Seed filling algorithm, can be 4 or 8 Unicom Unicom Choose one.