A(nxm,k, ¿) two-dimensional optical orthogonal code (2-D OOC),C, is a family ofnxm(0, 1)-arrays of constant weightksuch that¿i=1n¿j=0m-1A(i,j)B(i,j¿m¿) ¿ ¿ for any arraysA,BinCand any integer¿except whenA=Band¿ ¿ 0(modm), where¿mdenotes addition modulom. Such codes are of current practical interest as they enable optical communication at lower chip rate. To simplify practical implementation, the AM-OPPW (at most one-pulse per wavelength) restriction is often appended to a 2-D OOC. An AM-OPPW 2-D OOC is optimal if its size is the largest possible. In this paper, the notion of a perfect AM-OPPW 2-D OOC is proposed, which is an optimal(nxm,k, ¿) AM-OPPW 2-D OOC with cardinality[(m¿n(n-1)...(n-¿))/(k(k-1)...(k-¿))] . A link between optimal(nxm,k, ¿) AM-OPPW 2-D OOCs and block designs is developed. Some new constructions for such optimal codes are described by means of semicyclic group divisible designs. Several new infinite families of perfect(nxm,k, 1) AM-OPPW 2-D OOCs withk¿ {2, 3, 4} are thus produced.