George Saon
SLT 2014
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
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst
Mahesh Viswanathan, Homayoon S.M. Beigi, et al.
ICDAR 1999