Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
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
A statistical modeling approach to content based video retrieval
Milind R. Naphade, Sankar Basu, et al.
ICPR 2008
Simona Rabinovici-Cohen, Naomi Fridman, et al.
Cancers
Takashi Saito
IEICE Transactions on Information and Systems