Conference paper
Computer personnel research - Issues and progress in the 60's
David B. Mayer, Ashford W. Stalnaker
ACM SIGMIS CPR 1967
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
Conference paper
Semantic approach to event processing
Opher Etzion
DEBS 2007
Eli Packer, Asaf Tzadok, et al.
ICDAR 2011
Michelle X. Zhou, Fei Wang, et al.
ICMEW 2013