Incremental algorithms for optimal linebreaking in text layout

摘要

A computer-implemented incremental algorithm for updating globally optimized linebreaks for a paragraph following a change to that paragraph takes advantage of the fact that in many cases, the effect of a change on a paragraph is of only limited extent in the paragraph. As a result, in many cases, previously evaluated information concerning feasible breakpoints for the original paragraph can be used to obtain the optimal break for the changed paragraph. The computer-implemented incremental algorithm models the paragraph as an acyclic graph and identifies those portions of the graph that are unchanged as a result of the revision. The method then evaluates feasible breakpoints and combined these with feasible breakpoints obtained from the original paragraph. Using these breakpoints, the incremental algorithm uses dynamic programming to obtain the optimal break for the changed paragraph.