Rogerio Feris, Lisa M. Brown, et al.
ICPR 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
Edge guided single depth image super resolution
Jun Xie, Rogerio Schmidt Feris, et al.
ICIP 2014
Alok Aggarwal
IEEE TC
Conference paper
Semantic approach to event processing
Opher Etzion
DEBS 2007