R.A. Gopinath, Markus Lang, et al.
ICIP 1994
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
Rogerio Feris, Lisa M. Brown, et al.
ICPR 2014
Benny Kimelfeld, Yehoshua Sagiv
ICDT 2013
Kuan-Yu Chen, Shih-Hung Liu, et al.
EMNLP 2014