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
Hans-Werner Fink, Heinz Schmid, et al.
Journal of the Optical Society of America A: Optics and Image Science, and Vision
Kuan-Yu Chen, Shih-Hung Liu, et al.
EMNLP 2014
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025