Conference paper
View-invariant alignment and matching of video sequences
Cen Rao, Alexei Gritai, et al.
ICCV 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
Graham Mann, Indulis Bernsteins
DIMEA 2007
M. Abe, M. Hori
SAINT 2003
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI