I need to efficiently approximate this integral which represents the Gaussian-weighted area of a right triangle whose three points are the origin plus two points that form a vertical "edge", one of which is the edge's nearest point to the origin at $y=0$ and the other, the corner, which is at the same value of $x$. This integral has two inputs, $x$ which is the distance to the edge and $s$ which is the slope from the origin to the corner point. To help with avoiding high degree components the slope needs be no larger than 1 (if the slope is originally larger than 1 the inputs are swapped and the result used to subtract to $\operatorname{erf}(x)\operatorname{erf}(s)$).
$$\int_0^x \frac{\operatorname{erf}(t s) \exp(-t^2)}{2\sqrt{\pi}}\, dt$$
I tried to approximate it in the $x = [-3 , 3], s = [-1 , 1]$ range with a simple 2D Chebyshev approximation, however to achieve my desired maximum absolute error of about $4\cdot10^{-5}$ I need about 31 coefficients in my 2D polynomial. That's a bit much, ideally I would be able to use fewer operations. I have tried to improve the situation by applying operations to the integral before fitting, such as the reciprocal, dividing by $x$ or $s$ or trying to somehow use the limits to gain some sort of advantage, like making a polynomial to interpolate between the limit at $s=0$ (which is $\frac{1-\exp(-x^2)}{2\pi}$) and the integral at $s=1$ (which is $\frac{{\operatorname{erf}(x)}^2}{8}$), or somehow use the limit at $x=\inf$ (which for my purposes is very close to what we have at $x=3$) which is $\frac{\arctan(s)}{2\pi}$, but this didn't help much in achieving more precision with fewer polynomial coefficients. Perhaps there is something clever that I didn't think of or something completely different than a mere polynomial that could be more efficient, perhaps a way to break the problem down into 1D steps.
Integral to approximate, shown with added contours. Yellow is positive, blue negative. Horizontal axis is $x = [-3,3]$, vertical is $s = [-1,1]$.
I'm aware that I could well segment the approximation into a table of small piecewise 2D polynomials, however due to the need to avoid table lookups and dynamic branching I'd rather keep it all in one piece. This integral is used to closely approximate the ideal graphical result of a concave or convex polygon convolved with a 2D Gaussian kernel by calculating the sum of the Gaussian-weighted areas of triangular subdivisions of the polygon, my current implementation works nicely but needs more precision and hopefully can be made more efficient.

Wikipedia has a good discussion on the so-called error function including some approximation formulas available here.
I have employed one of the series approximation in a spreadsheet calculation with good results.
You must, for your problem, combine the above into a good numerical analysis routine to approximate the value of integral.
Good luck (as it is a process of trial and error).