convex hull

noun1

1. •
   The smallest convex set of points in which a given set of points is contained.

   • This problem can be solved in time O(nᶜ) by combining a weight-balanced tree of the convex hull vertices with a farthest neighbor data structure of Agarwal and Matoušek [2]. — 1994