C.H. Morimoto, D. Koons, et al.
Image and Vision Computing
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
Orly Stettiner, Dan Chazan
ICPR 1994
Rogerio Feris, Lisa M. Brown, et al.
ICPR 2014
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025