Manhattan routing
The term Manhattan Routing describes on the one hand a special type of connection lines in graphic modeling tools and on the other hand an algorithm for calculating networks in VLSI design for integrated circuits.
The name Manhattan Routing is derived from the graphical similarity to the street network of Manhattan , where most streets run almost at right angles and with similar distances from one another.
Manhattan routing in graphic modeling tools
In graphic modeling tools, Manhattan Routing describes the layout of connecting lines, in which only horizontal and vertical lines with right-angled branches / turns and fixed distances from one another can be used. It is usually irrelevant whether or not lines are allowed to cross or overlap. Typically, Manhattan routing is based on a grid or grid with fixed distances on which the lines run.
The term Manhattan Routing appears in this context. a. with the graphic editor framework Eclipse GEF.
The Manhattan routing is used in many current graphical modeling tools. Well-known representatives are the Eclipse GEF , Simulink or ASCET .
swell
- S. Das and B. Bhattacharya. Channel routing in manhattandiagonal model. Int'l Conf. on VLSI Design, 1996
- K. Cheng-Kok and PH Madden, “Manhattan or nonmanhattan? : A study of alternative VLSI routing architectures, ”in Proceedings of the 10th Great Lakes Symposium on VLSI, 2000.