Eli Packer, Asaf Tzadok, et al.
ICDAR 2011
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
Invisible watermarking technique for image verification
Minerva M. Yeung, Fred Mintzer
ICIP 1997
Conference paper
Case studies in hardware XPath acceleration
Dorit Nuzman, David Maze, et al.
SYSTOR 2011
Graham Mann, Indulis Bernsteins
DIMEA 2007