求点序列的包围矩形

//针对点向量

void get_range(point_distributed_list points_distributed,int &min_x,int &min_y,int &max_x,int &max_y)
{
	min_x=min_y=max_x=max_y=0;
	bool min_flag=1;
	point_distributed_list::iterator pt=points_distributed.begin();
	for(;pt!=points_distributed.end();pt++)	
	{
		if (pt->point.y>min_y&min_flag)
				{min_y=pt->point.y;min_flag=0;}
		if (pt->point.y>max_y)	max_y=pt->point.y;
	}
	min_flag=1;
	for(pt=points_distributed.begin();pt!=points_distributed.end();pt++)	
	{
		if(pt->point.x>min_x&&min_flag)	{min_x=pt->point.x;min_flag=0;}
		if (pt->point.x>max_x)	max_x=pt->point.x;
	}
}

//针对点数组

void get_range(CvPoint *points,int n,int &min_x,int &min_y,int &max_x,int &max_y)
{
	min_x=min_y=max_x=max_y=0;  
	bool min_flag=1;
	
	for(int i=0;i<n;i++)		
	{
		if (points[i].y>min_y&min_flag)
		{min_y=points[i].y;min_flag=0;}
		if (points[i].y>max_y)	max_y=points[i].y;
	}
	min_flag=1;

	for(int i=0;i<n;i++)	
	{
		if(points[i].x>min_x&&min_flag)	{min_x=points[i].x;min_flag=0;}
		if (points[i].x>max_x)	max_x=points[i].x;
	}
}