On Sat, 11 Jan 2014, Beno?t Minisini wrote:
> Le 11/01/2014 19:05, Tobias Boege a ?crit :
> > Hi,
> >
> > I just spent two good hours over my implementation of an algorithm to
> > arrange some PointFs in an array so that the distance between P[i] and
> > P[i+1] is the smallest possible among all po
Le 11/01/2014 19:05, Tobias Boege a écrit :
> Hi,
>
> I just spent two good hours over my implementation of an algorithm to
> arrange some PointFs in an array so that the distance between P[i] and
> P[i+1] is the smallest possible among all points P[j], j > i. I don't
> want to bother you with deta
Hi,
I just spent two good hours over my implementation of an algorithm to
arrange some PointFs in an array so that the distance between P[i] and
P[i+1] is the smallest possible among all points P[j], j > i. I don't
want to bother you with details (well, I think I already did, sorry) but
the compar
