Simona Rabinovici-Cohen, Naomi Fridman, et al.
Cancers
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
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025
Zhixian Yan, Dipanjan Chakraborty, et al.
EDBT 2011
Eli Packer, Asaf Tzadok, et al.
ICDAR 2011