A Convex Hull Inclusion Test

Authors:
T. Bailey;J. Cowles
Affiliations:
-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1987

Citing 0
Cited 2

A Bibliography on Digital and Computational Convexity (1961-1988)

IEEE Transactions on Pattern Analysis and Machine Intelligence
Lower bounds for testing triangle-freeness in Boolean functions

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.14

Visualization

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.