Xiaodan Song, Ching-Yung Lin, et al.
CVPRW 2004
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
Matt McKeon
IEEE TVCG
Peter L. Williams, Nelson L. Max, et al.
IEEE TVCG
Lalit R Bahl, Steven V. De Gennaro, et al.
IEEE Transactions on Speech and Audio Processing