//*************************
//获取点中y坐标最大值
//*************************
int CPolygonFillView::GetMaxY()
{
int result = points[0].y;
for(int i = 1; i < count; i++)
if(result < points[i].y)
result = points[i].y;
return result;
}
//*************************
//获取点中y坐标最小值
//*************************
int CPolygonFillView::GetMinY()
{
int result = points[0].y;
for(int i = 0; i < count; i++)
if(result > points[i].y)
result = points[i].y;
return result;
}
//*******************************************************************************
//判断是否为极值点,参数为一条边的y较小点和其在pionts数组中的下标
//*******************************************************************************
bool CPolygonFillView::IsSuperPoint(CPoint &point,int i)
{
if(i == 0)
return ((points[0].y > points[1].y&&points[0].y > points[count-1].y)
||(points[0].y < points[1].y&& points[0].y < points[count-1].y));
else if(i == count-1)
return ((points[i].y > points[0].y&&points[i].y > points[i-1].y)
||(points[i].y < points[0].y&&points[i].y < points[i-1].y));
else
return ((points[i].y > points[i-1].y&&points[i].y > points[i+1].y)
||(points[i].y < points[i-1].y&&points[i].y < points[i+1].y));
}
//*************************
//用改进的冒泡法对链表排序
//*************************
void CPolygonFillView::SortEdges()
{
if(he