Jia Cui, Yonggang Deng, et al.
ASRU 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
Qian Huang, George C. Stockman
ICPR 1994
Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst
Conference paper
Large-scale video hashing via structure learning
Guangnan Ye, Dong Liu, et al.
ICCV 2013