Arnon Amir, M. Lindenbaum
Computer Vision and Image Understanding
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
Aidong Lu, Christopher J. Morris, et al.
IEEE TVCG
Conference paper
Motion divergence fields for dynamic hand gesture recognition
Xiaohui Shen, Gang Hua, et al.
FG 2011
Girmaw Abebe Tadesse, Oliver Bent, et al.
IEEE SPM