New applications of failure functions
Journal of the ACM (JACM)
The least weight subsequence problem
SIAM Journal on Computing
The concave least-weight subsequence problem revisited
Journal of Algorithms
Speeding up dynamic programming with application to molecular biology
Theoretical Computer Science
Sequence comparison with mixed convex and concave costs
Journal of Algorithms
A grid-based approach to automating display layout
Proceedings on Graphics interface '88
Sparse dynamic programming II: convex and concave cost functions
Journal of the ACM (JACM)
The Computers & Typesetting, Vol. A: The Texbook
The Computers & Typesetting, Vol. A: The Texbook
On the pagination of complex documents
Computer Science in Perspective
Optimal pagination techniques for automatic typesetting systems
Optimal pagination techniques for automatic typesetting systems
Aesthetic measures for automated document layout
Proceedings of the 2004 ACM symposium on Document engineering
Support for arbitrary regions in XSL-FO
Proceedings of the 2005 ACM symposium on Document engineering
Constrained XSL formatting objects for adaptive documents
Proceedings of the 2005 ACM symposium on Document engineering
Automatic float placement in multi-column documents
Proceedings of the 2007 ACM symposium on Document engineering
Pattern-based segmentation of digital documents: model and implementation
ACM SIGWEB Newsletter
Hi-index | 0.00 |
The problem of line breaking consists of finding the best way to split paragraphs into lines. It has been cleverly addressed by the total-fit algorithm exposed by Knuth and Plass in a well-known paper. Similarly, page-breaking algorithms break the content flow of a document into page units. Formatting languages—such as the World Wide Web Consortium standard Extensible Stylesheet Language Formatting Objects (XSL-FO)—allow users to set which content should be kept in the same page and how many isolated lines are acceptable at the beginning/end of each page. The strategies most formatters adopt to meet these requirements, however, are not satisfactory for many publishing contexts as they very often generate unpleasant empty areas. In that case, typographers are required to manually craft the results in order to completely fill pages. This paper presents a page-breaking algorithm that extends the original Knuth and Plass line-breaking approach and produces high-quality documents without unwanted empty areas. The basic idea consists of delaying the definitive choice of breaks in the line-breaking process in order to provide a larger set of alternatives to the actual pagination step. The algorithm also allows users to decide the set of properties to be adjusted for pagination and their variation ranges. An application of the algorithm to XSL-FO is also presented, with an extension of the language that allows users to drive the pagination process. The tool, named FOP+, is a customized version of the open-source Apache Formatting Objects Processor formatter. Copyright © 2011 John Wiley & Sons, Ltd.