逆时针排列无序点集

void CounterclockwiseSortPoints(std::vector<cv::Point2f>& vPoints)
{
	int cnt = (int)vPoints.size();
	if (cnt < 3)
		return;

	//计算中心
	cv::Point2f center(0, 0);
	for (int i = 0; i < cnt; i++)
		center += vPoints[i];
	center /= cnt;

	//若点a大于点b,即点a在点b顺时针方向,返回true,否则返回false
	auto PointCmp = [](const cv::Point2f &a, const cv::Point2f &b, const cv::Point2f& center) {
		if (a.x >= 0 && b.x < 0)
			return true;
		if (a.x == 0 && b.x == 0)
			return a.y > b.y;
		//向量OA和向量OB的叉积
		float det = (a.x - center.x) * (b.y - center.y) - (b.x - center.x) * (a.y - center.y);
		if (det < 0)
			return true;
		if (det > 0)
			return false;
		//向量OA和向量OB共线，以距离判断大小
		float d1 = (a.x - center.x) * (a.x - center.x) + (a.y - center.y) * (a.y - center.y);
		float d2 = (b.x - center.x) * (b.x - center.y) + (b.y - center.y) * (b.y - center.y);
		return d1 > d2;
	};

	//冒泡排序
	for (int i = 0; i < cnt - 1; i++)
		for (int j = 0; j < cnt - i - 1; j++)
			if (PointCmp(vPoints[j], vPoints[j + 1], center))
				std::swap(vPoints[j], vPoints[j + 1]);
}

参考：

https://www.cnblogs.com/dwdxdy/p/3230156.html