What you've described is actually for placement, not routing, and is in fact a good analogy for the first step in many placement algorithms.
Interestingly, placement is much harder than routing from a complexity theory point of view (specifically, there are fairly strong inapproximability results for placement-style problems).