Let $Q(x,y,z)$ be a cubic polynomial with integer coefficients, such that the terms $x^3, y^3, z^3$ do not appear. That is, it is at most quadratic in each of the variables $x,y,z$.

Is there a general method to count integral points $(a,b,c)$ with $\max\{|a|, |b|, |c|\} \leq T$ on the affine cubic surface defined by $Q(x,y,z) = 0$?

The prototypical example is the Markoff surface defined by $Q(x,y,z) = x^2 + y^2 + z^2 - xyz$. Here Zagier showed that the density of integral points is asymptotic to $C (\log T)^2$ for some explicit constant $C > 0$. This is generalized by Baragar and Umeda in this paper.

Their method depends on an explicit descent on the Markoff surface, namely that for a given point $(a,b,c)$ the point $(bc - a, b, c)$ is also a point. Zagier then showed that all integral solutions are generated from the fundamental solution $(3,3,3)$ and by permuting the variables and applying the above map. This means that the set of solutions grows exponentially in size, hence giving the bound $O((\log T)^2)$.

Is there something similar that can be done, using only the fact that all of the monomials in $Q$ are at most quadratic in each variable?