Xiaodan Song, Ching-Yung Lin, et al.
CVPRW 2004
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.
Xiaodan Song, Ching-Yung Lin, et al.
CVPRW 2004
Xiaohui Shen, Gang Hua, et al.
FG 2011
Girmaw Abebe Tadesse, Oliver Bent, et al.
IEEE SPM
Tianwen Qian, Jingjing Chen, et al.
IEEE TMM