Table - PMC

Skip to main content

View full-text article in PMC

. 2023 Apr 13;25(4):653. doi: 10.3390/e25040653

Algorithm 1 The distribution algorithm

Input:

H

, the threshold n, area

{\hat{Q}}_{•}^{l}

, and area

Q_{•}^{l}

(

l = 1, 2, \dots, n

).
Output:
These n shares:

S_{1}, S_{2}, \dots, S_{n}

.

1:
for x from $1 to D$ do
2:
for y from $1 to D$ do
3:
/* $H$ consists of $D \times D$ modules.*/
4:
if $H (x, y) \in area {\hat{Q}}_{•}^{1} or area Q_{•}^{1}$ then
5:
$S_{1} (x, y) \leftarrow k$ .
6:
else
7:
$S_{1} (x, y) \leftarrow w$ .
8:
end if
9:
if $H (x, y) \in area {\hat{Q}}_{•}^{2} or area Q_{•}^{2}$ then
10:
$S_{2} (x, y) \leftarrow k$ .
11:
else
12:
$S_{2} (x, y) \leftarrow w$ .
13:
end if
14:
$⋮$
15:
if $H (x, y) \in area {\hat{Q}}_{•}^{n} or area Q_{•}^{n}$ then
16:
$S_{n} (x, y) \leftarrow k$ .
17:
else
18:
$S_{n} (x, y) \leftarrow w$ .
19:
end if
20:
end for
21:
end for

Output:

S_{1}, S_{2}, \dots, S_{n}