The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On the Generation of Heronian Triangles”

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...