C. Mohan
EDBT 2013
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
Michelle X. Zhou, Fei Wang, et al.
ICMEW 2013
Paul A. Karger
SOUPS 2006
Shyam Marjit, Harshit Singh, et al.
WACV 2025