I'd like to know how to calculate the resultant of two bivariate polynomials. Searching through the web, I read that there is an Euclid-like algorithm for univariate polynomials, and that one can use it for bivariate polynomials by considering them as univariate polynomials with polynomial coefficients.
The only version of this Euclid-like algorithm I found is the one below (found on MSE), where LC means "leading coefficient":
F_1 := F
F_2 := G
i := 2
R_1 := 1
while d_i:=deg(F_i) > 0:
F_{i+1} := F_{i-1} mod F_i
R_i := (-1)^{d_i * d_{i-1}} * LC(F_i)^{d_{i-1} - d_{i+1}} * R_{i-1}
i++
if F_i != 0 then return R_{i-1} * LC(F_i)^{d_{i-1}}
else return 0
However, in order to apply it to univariate polynomials with polynomial coefficients, I don't see how to get F_{i-1} mod F_i. Could you explain this point please? Or maybe orient me to another way, if this one is not the one to go?