On the generation of Heronian triangles

preprint2014arXivOpen access

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 this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

On the generation of Heronian triangles

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0