  A construction is given for the recovery of a disjoint union of strictly
convex smooth planar obstacles from travelling-time information. The obstacles
are required to be such that no Euclidean line meets more than two of them.
