The picture shows a set
of data points on a leaf surface.
We are looking for the optimal triangulation of these points.
You should:
1. Find any triangulation using the three rules — your triangles should have
the properties that [1] they cover the surface (no holes), [2] are pairwise
disjoint (no intersections), and [3] each triangle contains no data points
except its corner points.
2. Optimize it. [Remember you may need to form quadrilaterals by joining adjacent triangles and swaping the diagonals to optimize the angles.]
You will only need a pencil, a rubber and a protractor.
Send entries to:
Infinity Competition
Department of Mathematics
The University of Queensland
BRISBANE QLD 4072
by 30 October 2001 to be in the draw for a prize.
Competition from Infinity 11 — Minesweeper
Task: In
the Minesweeper grid, place four mines so that it remains consistent.
Answer:
| 1 | M | |||
| M | 1 | 1 | ||
| 1 | 0 | 1 | ||
| 1 | 1 | 1 | M | |
| M |
Our winner was Ashley Wright from Alexandra Hills in Queensland and a special mention goes to Benjamin Kwan for his fabulous drawing (see below).
