Takashi Saito
IEICE Transactions on Information and Systems
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
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025
Conference paper
Novel approaches for minutiae verification in fingerprint images
Sharat Chikkerur, Venu Govindaraju, et al.
WACV 2005
T. Syeda-Mahmood
Computer Vision and Image Understanding