Jeffrey Heer, Adam Perer
VAST 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
On efficient Viterbi decoding for hidden semi-Markov models
Ritendra Datta, Jianying Hu, et al.
ICPR 2008
Orly Stettiner, Dan Chazan
ICPR 1994
Mahesh Viswanathan, Homayoon S.M. Beigi, et al.
ICDAR 1999