Konstantinos Tarabanis, Roger Y. Tsai, 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
Orly Stettiner, Dan Chazan
ICPR 1994
Conference paper
Visualization of equations in an interactive environment
D. Watson, J. Wejchert, et al.
VIS 1991
C. Mohan
EDBT 2013