Skip to main content
. 2020 Jul 27;20(15):4171. doi: 10.3390/s20154171
Algorithm 2 PIA (p, A)

  1.  {

  2.   count: = 0;

  3.   for i: = 0 to n − 1 do

  4.   {

  5.    o1: = ai; o2: = ai+1;

  6.    o3: = p; o4: =(max(x(o1), x(o2)) + 1, y(p));

  7.    if (EEI(o1, o2, o3, o4) == 1) then count: = count + 1;

  8.   }

  9.   if (count % 2 == 1) then return 1;

  10.   else return 0;

  11.  }