anchor.diff:      P: TKMPoint;
       Indices: array[0..1] of Word;
     begin
  -    for K := 0 to fPolygons[aIdx].NearbyCount - 1 do
  +    for K := fPolygons[aIdx].NearbyCount - 1 downto 0 do
       begin
         SecondPoint := False;
         ToIdx := fPolygons[aIdx].Nearby[K];
  
positive.code:     ComputeNearbyPoints(K);
    end;
    FindClosestPolygon();
  end;
  
  procedure TKMNavMesh.TieUpPolygonsWithTiles();
  //var
  //  X,Y,Polygon: Integer;
  begin
    {
  
negative.code:     if (fPoint2PolygonArr[K - fMapX - 1] = 0) then AddToQueue(K - fMapX - 1, fPoint2PolygonArr[K]);
      if (fPoint2PolygonArr[K + fMapX + 1] = 0) then AddToQueue(K + fMapX + 1, fPoint2PolygonArr[K]);
    end;
  end;
  
  procedure TKMNavMesh.TieUpTilesWithPolygons();
    procedure GetNodesSortedByY(aIdx: Integer; var a,b,c: TKMPoint);
    begin
      a := fNodes[ fPolygons[aIdx].Indices[0] ];
      b := fNodes[ fPolygons[aIdx].Indices[1] ];
  