Conference paper
The hyperbox
Bowen Alpern, Larry Carter
VIS 1991
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
George Saon
SLT 2014
Mahesh Viswanathan, Homayoon S.M. Beigi, et al.
ICDAR 1999
Conference paper
Visualization of equations in an interactive environment
D. Watson, J. Wejchert, et al.
VIS 1991