Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025
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
Sudeep Sarkar, Kim L. Boyer
Computer Vision and Image Understanding
Zhixian Yan, Dipanjan Chakraborty, et al.
EDBT 2011
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI