George Saon
SLT 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
Conference paper
Asset Modeling using Serverless Computing
Srideepika Jayaraman, Chandra Reddy, et al.
Big Data 2021
Conference paper
The hyperbox
Bowen Alpern, Larry Carter
VIS 1991