SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Constraint cascading style sheets for the Web
Proceedings of the 12th annual ACM symposium on User interface software and technology
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
PODP '96 Proceedings of the Third International Workshop on Principles of Document Processing
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Constraint-based document layout for the Web
Multimedia Systems - Special issue: Multimedia authoring and presentation techniques
Setting tables and illustrations with style
Setting tables and illustrations with style
Proceedings of the 2005 ACM symposium on Document engineering
Solving the simple continuous table layout problem
Proceedings of the 2006 ACM symposium on Document engineering
The Design of the Zinc Modelling Language
Constraints
Propagation via lazy clause generation
Constraints
Review of automatic document formatting
Proceedings of the 9th ACM symposium on Document engineering
Active layout engine: Algorithms and applications in variable data printing
Computer-Aided Design
A new model for automated table layout
Proceedings of the 10th ACM symposium on Document engineering
ACM Transactions on the Web (TWEB)
Splitting wide tables optimally
Proceedings of the 2013 ACM symposium on Document engineering
| Hi-index | 0.00 |
Automatic layout of tables is useful in word processing applications and is required in on-line applications because of the need to tailor the layout to the viewport width, choice of font and dynamic content. However, if the table contains text, minimizing the height of the table for a fixed maximum width is a difficult combinatorial optimization problem. We present three different approaches to finding the minimum height layout based on standard approaches for combinatorial optimization. All are guaranteed to find the optimal solution. The first is an A*-based approach that uses an admissible heuristic based on the area of the cell content. The second and third are constraint programming (CP) approaches using the same CP model. The second approach uses traditional CP search, while the third approach uses a hybrid CP/SAT approach, lazy clause generation, that uses learning to reduce the search required. We provide a detailed empirical evaluation of the three approaches and also compare them with two mixed integer programming (MIP) encodings due to Bilauca and Healy.