Takashi Saito
IEICE Transactions on Information and Systems
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
T. Syeda-Mahmood
Computer Vision and Image Understanding
Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021
Conference paper
Visualization of equations in an interactive environment
D. Watson, J. Wejchert, et al.
VIS 1991