On the generation of Heronian triangles

We describe several algorithms for the generation of integer Heronian triangles with diameter at most $n$. Two of them have running time $\mathcal{O}\left(n^{2+\epsilon }\right)$. We enumerate all integer Heronian triangles for $n\le 600000$ and apply the complete list on some related problems.