M. F. Plass. Optimal pagination techniques for automatic typesetting systems. Technical Report STAN-CS-81-870, Department of Computer Science, Stanford University, 1981.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Praktische Informatik VI, Elberfelder Strae 95, 58084 Hagen, stefan.wohlfeil fernuni hagen.de From now on we call all floating objects figures, for short. 2 1 INTRODUCTION This situation calls for optimization algorithms. But expectations are dampened by the theoretical results by Plass [Pla81]; he proved that optimal page breaking is in general NP hard, hence computationally intractable. It is conceivable that these results have so far discouraged further e#ort towards better pagination algorithms. However, a closer inspection of Plass s work shows that one should not give up so soon. ....

....a bit so that they fit onto the same page as their citations and forcing the figure on page 13 onto an earlier page. Incidentally, this is how the document was actually printed. Our goal is to improve the automated process to a degree that only occasionally manual intervention is necessary. Plass [Pla81] was the first to research optimizing approaches to the pagination problem from an algorithmic point of view. His goal was to find paginations that place figures as closely as possible to their citations. He has suggested two goal functions, one linear and one quadratic, that measure paginations ....

M. F. Plass. Optimal pagination techniques for automatic typesetting systems. Technical Report STAN-CS-81-870, Department of Computer Science, Stanford University, 1981.

....with so far. From now on we call all floating objects figures, for short. CCC 0894 3982 95 020139 14 Received 1 April 1996 1995 by John Wiley Sons, Ltd. Revised 20 June 1996 This situation calls for optimization algorithms. But expectations are dampened by the theoretical results by Plass [2]; he proved that optimal page breaking is in general NP hard, hence computationally intractable. It is conceivable that these results have so far discouraged further effort towards better pagination algorithms. However, a closer inspection of Plass s work shows that one should not give up so ....

....a bit so that they fit onto the same page as their citations and forcing the figure on page 13 onto an earlier page. Incidentally, this is how the document was actually printed. Our goal is to improve the automated process to a degree that only occasionally is manual intervention necessary. Plass [2] was the first to research optimizing approaches to the pagination problem from an algorithmic point of view. His goal was to find paginations that place figures as closely as possible to their citations. He has suggested two goal functions, one linear and one quadratic, that measure paginations ....

M.F. Plass, `Optimal pagination techniques for automatic typesetting systems', Technical Report STAN-CS-81-870, Department of Computer Science, Stanford University, (1981).

....Work Document formatting problems arise in the production of all kinds of published material. Early research in this area focused on text formatting [12, 4, 9] True pagination and pagelayout problems have received less attention, though the eclectic nature of the little work that has been done [13, 7, 14, 1, 17, 6, 5] illustrates the broad range of problems that arise and the solutions that might be applied to them. Of previously reported approaches, the three most relevant for general pagination and MERL TR 96 29 October 1996 2 Figure 1: A sample page from the NYNEX Yellow Pages. page layout tasks are those ....

....from bin packing) no such polynomial time solution is likely to exist for these variants. However, certain restricted variants of YPPL, namely those in which ads must be retained in a specific order, may be amenable to dynamic programming solutions along the lines of the page layout algorithms of [13]. There are two disadvantages with pursuing this possibility. First, though the resulting algorithms are polynomial, their degrees would be prohibitive to use in practice. Second, variation among YPPL problems in their particulars is large; any given dynamic programming solution would be for a ....

M. F. Plass. Optimal Pagination Techniques for Automatic Typesetting Systems. PhD thesis, Stanford University, 1981.

....work. Background on Automated Layout In practice, the design of an efficient and optimal layout strategy for classified yellow page advertisements (ads) treated as a multidimensional placement problem and formalized as a constraint satisfaction problem is a complex computational task (cf. [9]) In addition to the complexity of any single layout, multimedia directory publishing also makes strong demands for flexibility, including the need for multiple pagination strategies, editable weighted grids, varying and prioritized optimization criteria, and heterogeneous user and ....

M.F. Plass. Optimal Pagination Techniques for Automatic Typesetting Systems. PhD thesis, Department of Computer Science Stanford University, Stanford, CA, USA, 1981.

....of Mainz shortly after the conference at Stanford [25] It is an open question whether we should follow T E X s page breaking algorithm at all, since it was stopped short because of the space and time constraints of the computers available at the time of its development. In his PhD thesis [26], M. Plass considered several global optimization strategies, using a two pass system. His results open a wide field for future research work. Some of his ideas seem to be used in the Type Set system [3] 1 Under normal circumstances, however, this is prevented by the badness function. 2 ....

Plass, Michael Frederick. Optimal Pagination Techniques for Automatic Typesetting Systems. PhD thesis, Stanford University, Department of Computer Science, Stanford, CA 94305, June 1981. Report No. STAN-CS-81-970.

....and this is why it is has been included. The idea that layout could be optimal seems to be due to Knuth and Plass [15] who presented an algorithm for the optimal breaking of a paragraph into lines which is used in Knuth s T E X system. Research work was done on more general optimality as well [21], although this author is unsure how much of this work was incorporated into T E X. Suitably generalized, their paragraph breaking algorithm is as follows. The first step is to deduce from the content a sequence of atomic formatting steps. For example, the content The cat sat on the mat might ....

Michael F. Plass. Optimal pagination techniques for automatic typesetting systems. Ph.D. thesis, Computer Science Department, Stanford University, Stanford, CA, 1981.

....algorithm would never have been developed, had it not been preceded by the invention of the model. The trade offs between functionality and efficiency of implementations may also be clarified by creating and analyzing document processing models. This is clearly illustrated in Plass s Ph.D. thesis [3] on optimal pagination techniques. In investigating abstract, mathematical models of page breaking viewed as an optimization problem, it is here shown how the choice of optimization measure seriously affects the computational complexity of the possible implementations. The works referred to above ....

Michael F. Plass, Optimal Pagination Techniques for Automatic Typesetting Systems.PhD thesis, Department of Computer Science, Stanford University, June 1981. Report no. STANCS -81-870.

....information. The bulk of previous work on automatic layout has concentrated on single media types e.g. in the context of graphics generation [30] and does not support the interplay between layout design and content planning. Besides many other approaches such as dynamic programming (e.g. [58]) graph drawing algorithms (cf. 27] relational grammars (e.g. 70, 22] rule based systems (e.g. 29, 46] and genetic algorithms (e.g. 46] especially constraint processing techniques as declarative knowledge representation formalism as well as efficient search and optimization ....

M. F. Plass. Optimal Pagination Techniques for Automatic Typesetting Systems. PhD thesis, Dept. of Computer Science, Stanford University, Stanford, CA, U.S.A., 1981.

....interplay between layout 1 German Research Center for Artificial Intelligence DFKI GmbH, Stuhlsatzenhausweg 3, D 66123 Saarbr ucken, Germany, graf dfki.unisb. de, http: www.dfki.uni sb.de graf design and content planning. Besides many other approaches such as dynamic programming (e.g. [32]) graph drawing algorithms (cf. 12] relational grammars (e.g. 38, 7] rule based systems (e.g. 14, 26] and genetic algorithms (e.g. 26] here especially constraint processing techniques as declarative knowledge representation formalism as well as efficient search and optimization ....

....we will show how the proposed model is successfully used in the IMMLM LayLab. 2 Intelligent Multimedia Layout In practice, the design of an efficient layout strategy for multimedia presentations treated as a search and optimization problem has been proven as a complex computational task (cf. [32]) In addition to the complexity of any single layout, multimedia layout also makes strong demands for flexibility, including the demand for multiple pagination strategies, varying and prioritized optimization criteria and heterogeneous user as well as application specific graphical, ....

M. F. Plass, Optimal Pagination Techniques for Automatic Typesetting Systems, Ph.D. dissertation, Dept. of Computer Science, Stanford University, Stanford, CA, U.S.A., 1981.

No context found.

M. F. Plass. Optimal pagination techniques for automatic typesetting systems. Technical Report STAN-CS-81-870, Department of Computer Science, Stanford University, 1981.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC