Conference paper
SLIC: Short-length iris codes
James E. Gentile, Nalini Ratha, et al.
BTAS 2009
Paper
Minimum area circumscribing Polygons
Abstract
We show that the smallest k-gon circumscribing a convex n-gon can be computed in O(n2 log n log k) time. © 1985 Springer-Verlag.
Related
Conference paper
The hyperbox
Bowen Alpern, Larry Carter
VIS 1991
Conference paper
A flexible elastic control plane for private clouds
Upendra Sharma, Prashant Shenoy, et al.
ICCAC 2013
Conference paper
Motion divergence fields for dynamic hand gesture recognition
Xiaohui Shen, Gang Hua, et al.
FG 2011