Title :
A Convex Hull Inclusion Test
Author :
Bailey, Thomas ; Cowles, John
Author_Institution :
Department of Computer Science, University of Wyoming, Laramie, WY 82071.
fDate :
3/1/1987 12:00:00 AM
Abstract :
A new characterization of the interior of the convex hull of a finite point set is given. An inclusion test based on this characterization is, on average, almost linear in the number of points times the dimensionality.
Keywords :
Character recognition; Clustering algorithms; Computational complexity; Computer science; Testing; Timing; Upper bound; Characterization; computational complexity; convex hull; high dimensionality; inclusion test; simplex algorithm;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
DOI :
10.1109/TPAMI.1987.4767904
