The array synthesis problem is of utmost importance and therefore a large number of papers have been devoted to it. A new synthesis method based on the intersection approach is presented: the synthesis is viewed as the problem of finding the intersection of sets. This is a more natural, flexible and effective formulation of the problem but despite this it has not previously received much attention. The search for a point belonging to the intersection of two sets allows a very effective solution procedure, based on the projector concept and on a suitable choice of the starting point of the iteration. A number of one and two dimensional examples are presented to highlight the various aspects of the method. Emphasis is put on constrained array synthesis which is important when the practical realisation of the synthesised array is of concern. The method permits the synthesis of constrained patterns without appreciable degradation of the pattern desired.