We describe several algorithms for the generation of integer Heronian
triangles with diameter at most n. Two of them have running time
O(n2+ε). We enumerate all integer Heronian
triangles for n≤600000 and apply the complete list on some related
problems.Comment: 10 pages, 2 figures, 2 tables.
http://sci-gems.math.bas.bg/jspui/handle/10525/38