Pavel Kisilev, Daniel Freedman, et al.
ICPR 2012
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
Computer personnel research - Issues and progress in the 60's
David B. Mayer, Ashford W. Stalnaker
ACM SIGMIS CPR 1967
Arnon Amir, M. Lindenbaum
Computer Vision and Image Understanding
Conference paper
A flexible elastic control plane for private clouds
Upendra Sharma, Prashant Shenoy, et al.
ICCAC 2013