M. Abe, M. Hori
SAINT 2003
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
A statistical modeling approach to content based video retrieval
Milind R. Naphade, Sankar Basu, et al.
ICPR 2008
Conference paper
Fingerprint image enhancement using weak models
Jonathan H. Connell, Nalini K. Ratha, et al.
ICIP 2002
Hagen Soltau, Lidia Mangu, et al.
ASRU 2011