Conference paper
Learning Situation Hyper-Graphs for Video Question Answering
Aisha Urooj Khan, Hilde Kuehne, et al.
CVPR 2023
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
The hyperbox
Bowen Alpern, Larry Carter
VIS 1991
Nicholas Mastronarde, Deepak S. Turaga, et al.
ICIP 2006
Conference paper
Case studies in hardware XPath acceleration
Dorit Nuzman, David Maze, et al.
SYSTOR 2011