Vivek Tyagi, Hima P. Karanam, et al.
ICPR 2012
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
Semantic approach to event processing
Opher Etzion
DEBS 2007
M. Abe, M. Hori
SAINT 2003
Conference paper
A statistical modeling approach to content based video retrieval
Milind R. Naphade, Sankar Basu, et al.
ICPR 2008