Eugene H. Ratzlaff
ICDAR 2001
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.
Eugene H. Ratzlaff
ICDAR 2001
Tianwen Qian, Jingjing Chen, et al.
IEEE TMM
Jeffrey Heer, Adam Perer
VAST 2011
David B. Mayer, Ashford W. Stalnaker
ACM SIGMIS CPR 1967