Conference paper
Anonymous and revocable fingerprint recognition
Faisal Farooq, Ruud M. Bolle, et al.
CVPR 2007
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
N.C. Narendra, Umesh Bellur, et al.
Middleware 2005
C. Mohan
EDBT 2013
Alok Aggarwal
IEEE TC