public void SearchPoint()
{
//Delaunay算法的主函数，遍历边链的每一条边，并分别进行处理
util u1 = new util();
u1.Tip_Time();
Node <PO> pt = work_pl.Head;
info.Insert("--start SearchPOint--");
loc = 0;
while (pt != null)
{
loc++;
if (pt == null)
{
break;
}
if (STOP)
{
break;
}
pkey = pt.Data;
pt.Data.ToPrint(info);//输出当前需要处理的点
pre_l = pt.Data.ll;
SearchLine();
PEBIGrid(pt.Data);
pt = pt.Next;
}
info.Insert("--SearchPOint end--\n");
u1.Span_from_last_time("runtime");
}