BibTeX
@MISC{Kurz_onthe,
author = {Sascha Kurz},
title = {On the generation of Heronian triangles},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
