Benny Kimelfeld, Yehoshua Sagiv
ICDT 2013
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
Image-based object editing
Holly Rushmeier, J. Gomes, et al.
3DIM 2003
Conference paper
Uncovering the Hidden Cost of Model Compression
Diganta Misra, Muawiz Chaudhary, et al.
CVPRW 2024
Aidong Lu, Christopher J. Morris, et al.
IEEE TVCG