Jia Cui, Yonggang Deng, et al.
ASRU 2009
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
Workshop paper
Image Manipulation via Neuro-Symbolic Networks
Harman Singh, Poorva Garg, et al.
NeurIPS 2022
Ritwik Kumar, Arunava Banerjee, et al.
IEEE TPAMI
Conference paper
The hyperbox
Bowen Alpern, Larry Carter
VIS 1991