Support points — Georg Nees, 1969

Dissertation 1969 · pp. 174 / 175

ALGOL 60

'COMMENT' No listing. P. 174:,
'Ten points are scattered
 and then joined to one another'.,

N.=10.,
'FOR' I.=1 'STEP' 1 'UNTIL' N 'DO'
'BEGIN' X[I].=J1(-130,130).,
        Y[I].=J2(-90,90)
'END'.,
'FOR' I.=1 'STEP' 1 'UNTIL' N-1 'DO'
'FOR' L.=I+1 'STEP' 1 'UNTIL' N 'DO'
'BEGIN' LEER(X[I],Y[I]).,
        LINE(X[L],Y[L])
'END'

This page · drawing kernel

JavaScript

const X = [], Y = [];
for (let I = 1; I <= 10; I++) {
  X.push(J1(-130, 130));
  Y.push(J2(-90, 90));
}
for (let i = 0; i < 9; i++) {
  for (let l = i + 1; l < 10; l++) {
    LEER(X[i], Y[i]);
    LINE(X[l], Y[l]);
  }
}
// from the prose p. 174, no listing.

P. 174: scatter ten points, then join every pair. The drawing shows the ten support points of figure 19, recovered from the scan. New seeds makes other individuals of the same grid (JS1, JS2). Figure 20 is the next pass without re-init — chapter ⑬.