Jeffrey Heer, Adam Perer
VAST 2011
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
Paul A. Karger
SOUPS 2006
Conference paper
Asset Modeling using Serverless Computing
Srideepika Jayaraman, Chandra Reddy, et al.
Big Data 2021
C. Mohan
EDBT 2013