{
PointDeque pnt que;
point deque::const _ iterator ITER;
pnt que . push _ front(points);
pnt que . push _ front(points);
无符号int I = 2;
while(I
{
if(pnt que . size()> 1)
{
if(CCW(pnt que,pntQue,points
)= = 1)
pnt que . push _ front(points);else
pnt que . pop _ front();
}
else
pnt que . push _ front(points);
}
for(ITER = pnt que . begin();iter!= pnt que . end();++ ITER)
pt sout . push _ back(acgepoint 3d(* ITER)。x,(*iter)。y,(*iter)。z));
}
//难以理解
而(i
{
if(pntQue.size()>1)
{
if(ccw(pntQue, pntQue, point)==1)
pntQue.push_front(point);
fe
pntQue.pop_front();
}
fe
pntQue.push_front(point);
}
很滑啊!,它使用std::deque测试下一个点是左转还是右转,如果是右转,弹出它,否则推它并测试下一点 更多阅读 http://en.wikipedia.org/wiki/Graham_scan 谢谢
页:
1
[2]