On the generation of Heronian triangles

Abstract

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.

10 pages, 2 figures, 2 tables. http://sci-gems.math.bas.bg/jspui/handle/10525/382

References in corpus (1)

• On the minimum diameter of plane integral point sets

Cited by in corpus (3)

• Maximal integral point sets in affine planes over finite fields
• Maximal integral point sets over ${\mathbb{Z}}^2$
• Errata and Addenda to Mathematical Constants