Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
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
C. Mohan
EDBT 2013
C.H. Morimoto, D. Koons, et al.
Image and Vision Computing
Alex Cozzi, Florentin Wörgötter
IJCV