noun
Meaning 1
The smallest convex set of points in which a given set of points is contained.
Definition source: English Wiktionary via Wiktextract
Topics: mathematics, sciences
Examples
- 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(nc) by combining a weight-balanced tree of the convex hull vertices with a farthest neighbor data structure of Agarwal and Matoušek [2].
Meaning relationships
Synonyms: none provided
Antonyms: none provided