Hanan grid
Jump to navigation
Jump to search
In geometry, the Hanan grid H(S)Script error: No such module "Check for unknown parameters". of a finite set Template:Mvar of points in the plane is obtained by constructing vertical and horizontal lines through each point in Template:Mvar.
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 Template:Mvar.[1] It is named after Maurice Hanan, who was first[2] to investigate the rectilinear Steiner minimum tree and introduced this graph.[3]
References
<templatestyles src="Reflist/styles.css" />
- ↑ Martin Zachariasen, A Catalog of Hanan Grid Problems Networks, vol. 38, 2000, pp. 200-221
- ↑ Christine R. Leverenz, Miroslaw Truszczynski, The Rectilinear Steiner Tree Problem: Algorithms and Examples using Permutations of the Terminal Set, 1999 ACM Southeast Regional Conference, 1999, Script error: No such module "CS1 identifiers".
- ↑ M. Hanan, On Steiner's problem with rectilinear distance Template:Webarchive, J. SIAM Appl. Math. 14 (1966), 255 - 265.
Script error: No such module "Check for unknown parameters".