Algorithm
Two stage process
Small L
Effective L, Small U at step 5
Connect path at (6, 7)
Start from boundary at second stage
Shortest distance so that G is close to the center
Previous slide
Next slide
Back to first slide
View graphic version