In geometry, the Hanan grid of a finite set of points in the plane is obtained by constructing vertical and horizontal lines through each point in . The main motivation for studying the Hanan grid stems from the fact that it is known to contain a minimum length rectilinear Steiner tree for . It is named after Maurice Hanan, who was first to investigate the rectilinear Steiner minimum tree and introduced this graph. References Graph families Geometric graphs