我正在编写一个程序来获得一个凸包。我需要按极角对点进行排序,并且我base
之前选择了一个点,所以我编写了一个成员比较函数(注意,对于每个对象,base
点是不同的)。但是当我将它应用于 时std::sort
,程序无法编译。
这是我的程序:
class ConvexHull
{
Point p[MAXN], base;
public:
int size;
void Create(Point (&)[MAXN], const int);
bool cmp(const Point& a, const Point& b) const
{
static int tmp;
return (tmp = CrossProduct(base, a, base, b)) < 0 || (tmp == 0 && Dist(base, a) < Dist(base, b));
}
};
void ConvexHull::Create(Point (&a)[MAXN], const int n)
{
base = a[0];
for (int i = 1; i < n; ++i)
if (a[i].x < base.x || (a[i].x == base.x && a[i].y < base.y))
base = a[i];
std::sort(a, a+n, cmp);
p[0] = a[0], p[1] = a[1];
size = 2;
for (int i = 2; i < n; ++i)
{
while (size >= 2 && CrossProduct(a[i], p[size-1], a[i], p[size-2]) <= 0) --size;
p[size++] = a[i];
}
p[size++] = p[0];
}
这是错误:
poj1113.cc: In member function 'void ConvexHull::Create(Point (&)[1000], int)':
poj1113.cc:41:24: error: no matching function for call to 'sort(Point [1000], Point*, <unresolved overloaded function type>)'
poj1113.cc:41:24: note: candidates are:
In file included from /usr/include/c++/4.7/algorithm:63:0,
from poj1113.cc:3:
/usr/include/c++/4.7/bits/stl_algo.h:5463:5: note: template<class _RAIter> void std::sort(_RAIter, _RAIter)
/usr/include/c++/4.7/bits/stl_algo.h:5463:5: note: template argument deduction/substitution failed:
poj1113.cc:41:24: note: candidate expects 2 arguments, 3 provided
In file included from /usr/include/c++/4.7/algorithm:63:0,
from poj1113.cc:3:
/usr/include/c++/4.7/bits/stl_algo.h:5499:5: note: void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = Point*; _Compare = bool (ConvexHull::*)(const Point&, const Point&)const]
/usr/include/c++/4.7/bits/stl_algo.h:5499:5: note: no known conversion for argument 3 from '<unresolved overloaded function type>' to 'bool (ConvexHull::*)(const Point&, const Point&)const'
如何解决?这(我的意思是让base
会员)是一个糟糕的设计吗?