Recursive Graph Bisection
Based on graph distance rather than coordinate distance.
Determine the two furthest separated nodes
Organize and partition nodes according to their distance from extremities.
Computationally expensive
- Can use approximation methods.