The problem is that sometimes you can't find a factorization for the algebric expressions. If you can is just to use Mark's approach.
If not, a more general way is use the same approach that we use to find the $\gcd$ between integer numbers. Which is based on Euclides's division algorithm.
Step $1)$: Divide $$a(y)=2y^4-18x^2y^2-48xy^2-32y^2$$ by $$b(x)=y^2-10y+24+6x-9x^2$$ w.r.t. the variable $y$ and find the quotient $q_1(x)$ and the remainder $r_1(x)$.
$$\text{So,}\quad a(x)=b(x)q_1(x)+r_1(x)$$
Step $2)$: Divide $b(x)$ by $r_1(x)$ and get quotient $q_2(x)$ and remainder $r_2(x)$
$$\text{So,}\quad b(x)=r_1(x)q_2(x)+r_2(x)$$
Step $3)$: Divide $r_1(x)$ by $r_2(x)$ and get quotient $q_3(x)$ and remainder $r_3(x)$
$$\text{So,}\quad r_1(x)=r_2(x)q_3(x)+r_3(x)$$
and go on untill find $r_n(x)=0$. Then $\gcd(a(x),b(x))=r_{n-1}(x)$.