  Several ways to accelerate the solution of 2D/3D linear min-max problems in
$n$ constraints are discussed. We also present an algorithm for solving such
problems in the 2D case, which is superior to CGAL's linear programming solver,
both in performance and in stability.
