Hannah Kim, Celia Cintas, et al.
IJCAI 2023
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
C.H. Morimoto, D. Koons, et al.
Image and Vision Computing
Conference paper
Novel approaches for minutiae verification in fingerprint images
Sharat Chikkerur, Venu Govindaraju, et al.
WACV 2005
Workshop paper
Automatic task slots assignment in Hadoop MapReduce
Kun Wang, Juwei Shi, et al.
PACT 2011