Discrete Algorithms 473-482, 1997. Computing a point in the center of a point set in three dimensions. On lines and planes of closest fit to points in space. On range reporting, ray shooting, and k-level construction. Geom. , to appear.
Parsimony is hard to beat .
Cavender-Farris model , parsimony . P. J. Rousseeuw and M. Hubert. Regression depth . Assn. to appear. Computing location depth and regression depth in higher dimensions .