I got help here with a formula to find Pythagorean triples given only area. Using Euclid's formula, $Area = D=m^3 n-mn^3\quad$ the final equations are:
$$n_0=2\sqrt{\frac{m^2}{3}}\cos\biggl({\biggl(\frac{1}{3}\biggr)\arccos{\biggl(-\frac{3\sqrt{3}D}{2m^4}\biggr)}\biggr)}$$ $$n_1=2\sqrt{\frac{m^2}{3}}\cos\biggl({\biggl(\frac{1}{3}\biggr)\arccos{\biggl(\frac{3\sqrt{3}D}{2m^4}\biggr)}\biggr)}$$ $$n_2=n_1-n_0$$
where $$\lfloor\sqrt[4]{D}\rfloor\le m\le \lceil\sqrt[3]{D}\space \rceil$$
Given an area $D$, any value of $m$ that yields an integer for one-or-more of $n_0, n_1, n_2$ provides the $m,n$ values that identify a triple that has area $D$. The limits I show are heuristic; I found them by experimentation in a spreadsheet. I would like to justify them with something more than, "they work", but I can't and I would also like to do better if possible.
Are there logical reasons for my limits? and Is there a way to narrow the search or is this as good as it gets?