From Surf Wiki (app.surf) — the open knowledge base
Hanan grid
Geometric grid created from horizontal and vertical lines drawn through each point in a set
Geometric grid created from horizontal and vertical lines drawn through each point in a set
In geometry, the Hanan grid H(S) of a finite set S of points in the plane is obtained by constructing vertical and horizontal lines through each point in S.
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 S. It is named after Maurice Hanan, who was firstChristine R. Leverenz, Miroslaw Truszczynski, The Rectilinear Steiner Tree Problem: Algorithms and Examples using Permutations of the Terminal Set, 1999 ACM Southeast Regional Conference, 1999, to investigate the rectilinear Steiner minimum tree and introduced this graph.
References
References
- Martin Zachariasen, ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.3586 A Catalog of Hanan Grid Problems]'' ''Networks'', vol. 38, 2000, pp. 200-221
- M. Hanan, [http://amadeus.ecs.umass.edu/mie373/hanan_rsmt.pdf On Steiner's problem with rectilinear distance] {{Webarchive. link. (2016-03-04 , J. SIAM Appl. Math. 14 (1966), 255 - 265.)
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Hanan grid — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report