arXiv · 1401.6150
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+\varepsilon}\right)$. We enumerate all integer Heronian triangles for $n\le 600000$ and apply the complete list on some related problems.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sascha Kurz. 2014-01-11. On the generation of Heronian triangles. https://arxiv.org/abs/1401.6150
Cite the original work for its findings. Save a collection to share your selection of sources.