Solving the simple continuous table layout problem

Nathan Hurst, Kim Marriott, David Albrecht
2006 Proceedings of the 2006 ACM symposium on Document engineering - DocEng '06  
Automatic table layout is required in web applications. Unfortunately, this is NP-hard for reasonable layout requirements such as minimizing table height for a given width. One approach is to solve a continuous relaxation of the layout problem in which each cell must be large enough to contain the area of its content. The solution to this relaxed problem can then guide the solution to the original problem. We give a simple and efficient algorithm for solving this continuous relaxation for the
more » ... se that cells do not span multiple columns or rows. The algorithm is not only interesting in its own right but also because it provides insight into the geometry of table layout.
doi:10.1145/1166160.1166169 dblp:conf/doceng/HurstMA06 fatcat:nsjlgjcsm5crtlmw3gztkge2na