Alok Aggarwal
IEEE TC
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
Aidong Lu, Christopher J. Morris, et al.
IEEE TVCG
Conference paper
The hyperbox
Bowen Alpern, Larry Carter
VIS 1991
Ba Tu Truong, Svetha Venkatesh, et al.
ICPR 2002