convex hull

Noun

 * 1)  The smallest convex set of points in which a given set of points is contained.
 * 2) * 1994, David Eppstein, Chapter 10: Average Case Analysis of Dynamic Geometric Optimization,, , Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, page 83,
 * This problem can be solved in time O(nc) by combining a weight-balanced tree of the convex hull vertices with a farthest neighbor data structure of Agarwal and Matoušek [2].

Translations

 * Finnish: konveksi verho
 * French:
 * Italian: inviluppo convesso, involucro convesso