Conference paper
Invisible watermarking technique for image verification
Minerva M. Yeung, Fred Mintzer
ICIP 1997
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
Enhanced graphics performance with user controlled segment files
W.D. Little, R. Williams
SIGGRAPH 1976
Jeffrey Heer, Adam Perer
VAST 2011
Conference paper
Learning Situation Hyper-Graphs for Video Question Answering
Aisha Urooj Khan, Hilde Kuehne, et al.
CVPR 2023