Auto-Matching Algorithm of Regular Fragments Based on Character Characteristic
MA Junmin · Journal of Shantou University · 2014
A new auto-matching algorithm of regular fragments based on analyzing the characters of printed Chinese document with the standard format is proposed. The third attachment of Problem B of Contemporary Undergraduate Mathematical Contest in Modeling in2013 is used as samples of regular fragments. By analyzing the height of lines and space between lines, several criteria are set up to classify regular fragments and transform the arrangement of lines and pages to the traveling salesman problem. MATLAB and LINGO programs are developed according to the auto-matching algorithm of regular fragments.Experimental results demonstrate that the algorithm is efficient.