Jianchang Mao, Patrick J. Flynn, et al.
Computer Vision and Image Understanding
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
Conference paper
Learning Situation Hyper-Graphs for Video Question Answering
Aisha Urooj Khan, Hilde Kuehne, et al.
CVPR 2023
Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025