
164
IrIs BIometrIC modeL
where N represents the maximum index number at the level of the
leaf of the tree.
After insertion of
relative to g
d
, if the number of elements
N′ of the leaf Bcp[i] exceeds N, we apply the method of dividing the
node into two nodes, Bcp
1
[i] and Bcp
2
[i]. We seek the middle index
Bcp[M] corresponding to the position M in the node Bcp[i]. We add
in Bcp
1
[i] the elements Bcp[h], where h = 1 . . . (M-1), and in Bcp
2
[i]
the elements Bcp[h], where h = M . . . N′.
9.1.3.2 Algorithm to Search for a Gabarit DHVA e search algorithm
of a gabarit DHVA is represented by the pseudocode illustrated in
Figure9.4. is algorithm consists ...