Fast Adaptive Character Animation Synthesis Based on Greedy Algorithm

Algorithm 1

Reconstruction of the multipath greedy algorithm.

	Input: minimum cell T and maximum number of reserved schemes L
	Output: region R after integration
(1)
(2)	for each do
(3)	for each do
(4)
(5)	for each
(6)
(7)
	end for
(8)	for each do
(9)
	end for
	The biggest K solutions of fit
	end for
	The biggest solution of fit
	return R