一个算法

 foreach($a as $i=>$av){
  foreach($av as $j=>$avv){
   if($avv && ($i!=$ii && $j!=$jj)){
    foreach($maxij as $maxPn=>$maxP){//最长点可能有多个啊！可能有多个算法因子
     $angle=angle(array($ii,$jj),$maxP,array($i,$j));//获得角度
     //echo $angle.'---';
     $z[$i][$j][an][$maxPn]=$angle;

     $arn=ceil($angle/$per)-1;
     $arn<0 && $arn=0;
     $mKey[$maxPn][$arn][all]+=10*($z[$i][$j][lline])/$max;
     $mKey[$maxPn][$arn][n]+=1;
    }
   }
  }
 }
 foreach($maxij as $maxPn=>$maxP){
  $rkey[$maxPn][0]=($mKey[$maxPn][0][all]+$mKey[$maxPn][($pin-1)][all])/($mKey[$maxPn][0][n]+$mKey[$maxPn][($pin-1)][n]);
  $ckey[$maxPn][0].=($rkey[$maxPn][0]>($max/2))?1:0;
  $ckey[$maxPn][0].=($rkey[$maxPn][0]>($max/1.5))?1:0;
  for($t=1;$t<$pin-1;$t++){
   if($t%2) continue;
   else{
    if($mKey[$maxPn][$t][n]+$mKey[$maxPn][($t-1)][n]){
     $rkey[$maxPn][($t/2)]=($mKey[$maxPn][$t][all]+$mKey[$maxPn][($t-1)][all])/($mKey[$maxPn][$t][n]+$mKey[$maxPn][($t-1)][n]);
     $ckey[$maxPn][($t/2)].=($rkey[$maxPn][($t/2)]>($max/2))?1:0;
     $ckey[$maxPn][($t/2)].=($rkey[$maxPn][($t/2)]>($max/1.5))?1:0;
    }
    else
     $ckey[$maxPn][($t/2)].='00';
   }
  }
  $vkey[$maxPn]=join('',$ckey[$maxPn]);
 }