Displaying similar documents to “A parametrization of equilateral triangles having integer coordinates.”

On the Generation of Heronian Triangles

Kurz, Sascha (2008)

Serdica Journal of Computing

Similarity:

We describe several algorithms for the generation of integer Heronian triangles with diameter at most n. Two of them have running time O(n^(2+ε)). We enumerate all integer Heronian triangles for n ≤ 600000 and apply the complete list on some related problems.

Constructing 7-Clusters

Kurz, Sascha, Noll, Landon Curt, Rathbun, Randall, Simmons, Chuck (2014)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): G.2, G.4. A set of n lattice points in the plane, no three on a line and no four on a circle, such that all pairwise distances and coordinates are integers is called an n-cluster (in R^2). We determine the smallest 7-cluster with respect to its diameter. Additionally we provide a toolbox of algorithms which allowed us to computationally locate over 1000 different 7-clusters, some of them having huge integer edge lengths. Along the...