Routing non-convex grids without holes

This paper is part of a complete solution of the two-terminal net routing problem for certain non-convex grids without holes that the authors call Z-grids, that part being the embedding of a non-even Z-grid routing problem in an even Z-grid routing problem. This embedding algorithm runs in time O(b), where b is the size of the boundary.