A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
Computers and Operations Research
Minimum sized text containment shapes
Proceedings of the 2006 ACM symposium on Document engineering
Automating branch-and-bound for dynamic programs
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Blocked recursive image composition
MM '08 Proceedings of the 16th ACM international conference on Multimedia
Review of automatic document formatting
Proceedings of the 9th ACM symposium on Document engineering
Compiling mockups to flexible UIs
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Hierarchical probabilistic model for news composition
Proceedings of the 2013 ACM symposium on Document engineering
Balancing font sizes for flexibility in automated document layout
Proceedings of the 2013 ACM symposium on Document engineering
| Hi-index | 0.00 |
Guillotine-based page layout is a method for document layout commonly used by newspapers and magazines, where each region of the page either contains a single article, or is recursively split either vertically or horizontally. Suprisingly there appears to be little research into algorithms for automatic guillotine-based document layout. In this paper we give efficient algorithms to find optimal solutions to guillotine layout problems of two forms. Fixed-cut layout is where the structure of the guillotining is given and we only have to determine the best configuration for each individual article to give the optimal total configuration. Free layout is where we also have to search for the optimal structure. We give bottom-up and top-down dynamic programming algorithms to solve these problems, and propose a novel interaction model for documents on electronic media. Experiments show that our algorithms are effective for realistic layout problems.