Peter L. Williams, Nelson L. Max, et al.
IEEE TVCG
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
Mahesh Viswanathan, Homayoon S.M. Beigi, et al.
ICDAR 1999
Conference paper
Enhanced graphics performance with user controlled segment files
W.D. Little, R. Williams
SIGGRAPH 1976
Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021