Rogerio Feris, Lisa M. Brown, et al.
ICPR 2014
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
Attribute-based people search in surveillance environments
Daniel A. Vaquero, Rogerio S. Feris, et al.
WACV 2009
Jehanzeb Mirza, Leonid Karlinsky, et al.
NeurIPS 2023
Sören Bleikertz, Carsten Vogel, et al.
ACSAC 2014