convex hull

短语

[计] 凸包, 凸壳

词形变化

convex hulls 复数 convex hulls

释义与例句

n.
  1. 1.

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

    数学

    1994, David Eppstein, Chapter 10: Average Case Analysis of Dynamic Geometric Optimization, Association of Computing Machinery, Society for Industrial and Applied Mathematics, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, page 83, 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].