Matt McKeon
IEEE TVCG
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
Lattice-based Viterbi decoding techniques for speech translation
George Saon, Michael Picheny
ASRU 2007
Conference paper
A flexible elastic control plane for private clouds
Upendra Sharma, Prashant Shenoy, et al.
ICCAC 2013
Conference paper
Attribute-based people search in surveillance environments
Daniel A. Vaquero, Rogerio S. Feris, et al.
WACV 2009