Conference paper
Asset Modeling using Serverless Computing
Srideepika Jayaraman, Chandra Reddy, et al.
Big Data 2021
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
Eugene H. Ratzlaff
ICDAR 2001
Conference paper
Write amplification analysis in flash-based solid state drives
Xiao-Yu Hu, Evangelos Eleftheriou, et al.
Israeli SYSTOR 2009
Conference paper
The hyperbox
Bowen Alpern, Larry Carter
VIS 1991