skip to main content
10.1145/2361354.2361359acmconferencesArticle/Chapter ViewAbstractPublication PagesdocengConference Proceedingsconference-collections
research-article

Optimal guillotine layout

Published:04 September 2012Publication History

ABSTRACT

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.

References

  1. Reuters-21578, Distribution 1.0. http://www.daviddlewis.com/resources/testcollections/reuters21578.Google ScholarGoogle Scholar
  2. R. Alvarez-Valdés, A. Parajón, and J. M. Tamarit. A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Computers & OR, 29(7):925--947, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. B. Atkins. Blocked recursive image composition. In Proceedings of the 16th International Conference on Multimedia 2008, pages 821--824, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. N. Christofides and E. Hadjiconstantinou. An exact algorithm for orthogonal 2-d cutting problems using guillotine cuts. European Journal of Operational Research, 83(1):21--38, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  5. N. Christofides and C. Whitlock. An algorithm for two-dimensional cutting problems. Operations Research, pages 30--44, 1977.Google ScholarGoogle Scholar
  6. M. Garey and D. Johnson. Computers and intractability. W. H. Freeman, 1979.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. E. Goldenberg. Automatic layout of variable-content print data. Master's thesis, School of Cognitive & Computing Sciences, University of Sussex, 2002.Google ScholarGoogle Scholar
  8. J. González, J. Merelo, P. Castillo, V. Rivas, and G. Romero. Optimizing web newspaper layout using simulated annealing. In J. Mira and J. Sanchez-Andres, editors, Engineering Applications of Bio-Inspired Artificial Neural Networks, volume 1607 of Lecture Notes in Computer Science, pages 759--768. Springer Berlin / Heidelberg, 1999.Google ScholarGoogle Scholar
  9. N. Hurst. Better Automatic Layout of Documents. PhD thesis, Monash University, Department of Computer Science, May 2009.Google ScholarGoogle Scholar
  10. N. Hurst, W. Li, and K. Marriott. Review of automatic document formatting. In Proceedings of the 9th ACM symposium on Document engineering, pages 99--108. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. N. Hurst, K. Marriott, and P. Moulder. Minimum sized text containment shapes. In DocEng '06: Proceedings of the 2006 ACM symposium on Document engineering, pages 3--12, New York, NY, USA, 2006. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Puchinger and P. Stuckey. Automating branch-and-bound for dynamic programs. In R. Glück and O. de Moor, editors, Proceedings of the ACM SIGPLAN 2008 Workshop on Partial Evaluation and Program Manipulation (PEPM '08), pages 81--89. ACM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. T. Strecker and L. Hennig. Automatic layouting of personalized newspaper pages. In B. Fleischmann, K.-H. Borgwardt, R. Klein, and A. Tuma, editors, Operations Research Proceedings 2008, pages 469--474. Springer Berlin Heidelberg, 2009.Google ScholarGoogle Scholar

Index Terms

  1. Optimal guillotine layout

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        DocEng '12: Proceedings of the 2012 ACM symposium on Document engineering
        September 2012
        256 pages
        ISBN:9781450311168
        DOI:10.1145/2361354

        Copyright © 2012 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 4 September 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate178of537submissions,33%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader