Viewpoint-Driven Simplification of Plant and Tree Foliage

. 2018 Mar 21;20(4):213. doi: 10.3390/e20040213

Algorithm 1: Process of leaf simplification.
1	$/ /$ Initialize the number of cameras
2	$n = 20$
3	$/ /$ Compute the initial VMI for the foliage F
4	Compute $I (v, F)$ where $v = {1, \dots, n}$
5	$/ /$ Initialize the set of leaves to evaluate
6	$F^{'} = F$
7	$/ /$ Repeat the process until the number of leaves is the established number
8	while $(n u m b e r_o f_l e a v e s (F^{'})) > L e a v e s_T o_R e m a i n)$ do
9	$m i n_c o s t = 1000.0$ // Initialize the cost
10	for ( $l \in F$ )
11	remove l to obtain $F^{'}$
12	Compute $I (v, F^{'})$ where $v = {1, \dots, n}$
13	$L_{p r u} (l) = \|I (v, F) - I (v, F^{'})\|$
14	if $m i n_c o s t > L_{p r u} (l)$ then
15	$l e a f_t o_p r u n e$ = l
16	$m i n_c o s t = L_{p r u} (l)$
17	end if
18	Undo removal
19	end for
20	$/ /$ Remove $l e a f_t o_p r u n e$
21	$F^{'} = F^{'} - (l e a f_t o_p r u n e)$
22	$/ /$ Obtain the $n e a r e s t_l e a f$ of $l e a f_t o_p r u n e$
23	$n e a r e s t_l e a f = N e a r_L e a f (F^{'}, l e a f_t o_p r u n e)$
24	$/ /$ Scale the size of $n e a r e s t_l e a f$ according to Equation (5)
25	$n e a r e s t_l e a f . a r e a_s i z e = R e s i z e (n e a r e s t_l e a f, l, m i n_c o s t)$
26	end while