Conference paper
View-invariant alignment and matching of video sequences
Cen Rao, Alexei Gritai, et al.
ICCV 2003
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
Large-scale video hashing via structure learning
Guangnan Ye, Dong Liu, et al.
ICCV 2013
Conference paper
Motion divergence fields for dynamic hand gesture recognition
Xiaohui Shen, Gang Hua, et al.
FG 2011
Conference paper
Unified solution for procurement integration and B2B stores
Trieu C. Chieu, Shiwa S. Fu, et al.
ICEC 2003