The worst-case behavior of planar matching heuristics, which
use triangular buckets and spacefilling curves, is investigated.
This planar matching problem is a main subproblem in optimizing
the plotter pen movement.