Aidong Lu, Christopher J. Morris, et al.
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
Edge guided single depth image super resolution
Jun Xie, Rogerio Schmidt Feris, et al.
ICIP 2014
Tianwen Qian, Jingjing Chen, et al.
IEEE TMM
Peter L. Williams, Nelson L. Max, et al.
IEEE TVCG