HOME

TheInfoList



OR:

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.M. Hanan
On Steiner's problem with rectilinear distance
J. SIAM Appl. Math. 14 (1966), 255 - 265.


References

{{reflist Graph families Geometric graphs