Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
N.C. Narendra, Umesh Bellur, et al.
Middleware 2005
Conference paper
On efficient Viterbi decoding for hidden semi-Markov models
Ritendra Datta, Jianying Hu, et al.
ICPR 2008
Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters