On the Generation of Heronian Triangles

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

ACM Computing Classification System (1998): G.2, G.4.

Approximating the MaxMin and MinMax Area Triangulations using Angular Constraints

* A preliminary version of this paper was presented at XI Encuentros de Geometr´ia Computacional, Santander, Spain, June 2005.

Едно обобщение на Наполеоновите триъгълници

Dimitar Belev, Vasilka Ignatova-Beleva - We present a generalization of the Napoleon triangles and investigate some of their properties.