Zhixian Yan, Dipanjan Chakraborty, et al.
EDBT 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
Conference paper
Fingerprint image enhancement using weak models
Jonathan H. Connell, Nalini K. Ratha, et al.
ICIP 2002
Ba Tu Truong, Svetha Venkatesh, et al.
ICPR 2002
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI