Fast algorithm for multiple-objects min-ε problem
Published • Jun 21, 2004
Authors:,
Alexander Kolesnikov
Pasi Fränti
Abstract
Fast algorithm for joint near-optimal approximation of multiple polygonal curves is proposed. It is based on iterative reduced-search dynamic programming introduced earlier for the min-/spl epsiv/ problem of a single polygonal curve. The proposed algorithm jointly optimizes the number of line segmen...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!