Geometric Optimization Problems Constant-level greedy triangulations approximate the MWT well. Matching convex shapes with respect to the symmetric difference. Easy and hard cases. Three-clustering of points in the plane. Finding a shortest vector in a two-dimensional lattice modulo m.
Triangulations intersect nicely.
World Publishing Corporation, 1996. Matching convex shapes with respect to the symmetric difference. In J. D az, M. Serna, editors, Algorithms - ESA '96. Fourth Annual European Symposium on Algorithms, Barcelona , volume 1136 of Lecture Notes in Computer Science , pages 320-333. Solution to problem 74.