Toward tighter tables

Hurst, Nathan; Marriott, Kim; Moulder, Peter V.

doi:10.1145/1096601.1096623

Cited by 13 publications

(13 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Beaumont [9] and Hurst et al [38] suggested a non-linear continuous approximation in which the area of each cell is constrained to be greater than the area of its content (when laid out in a single line). Beaumont used the nonlinear solver MINOS to solve the resulting non-linear problem while Hurst et al noted that it was a convex optimization problem and could be modelled using conic programming and solved using polynomial time interior point methods.…”

Section: Cell-driven Layoutmentioning

confidence: 99%

“…Hurst et al [38] also gave a simple hill-climbing local search method for table layout. The algorithm starts from the narrowest layout for the table and iteratively reduces the height of a row (and hence the table) by choosing to narrow the row for which this will lead to the least increase in width (for a given height reduction).…”

Section: Cell-driven Layoutmentioning

confidence: 99%

“…However they are quite complex and assume that the box contains uniform height text with no complex formatting. Thus Hurst et al [38] gave a O(W ) dynamic programming algorithm where W is the number of words while Anderson and Sobti gave an O(N 1/2 log N ) time algorithm where N is the length of the total text. However the Anderson and Sobti algorithm requires a significant once-off pre-computation that takes, as best we understand, O(N 3/2 log N ) time.…”

Section: Minimal Configurationsmentioning

confidence: 99%

See 2 more Smart Citations

Review of automatic document formatting

Hurst

Marriott

2009

Proceedings of the 9th ACM Symposium on Document Engineering

Self Cite

View full text Add to dashboard Cite

We review the literature on automatic document formatting with an emphasis on recent work in the field. One common way to frame document formatting is as a constrained optimization problem where decision variables encode element placement, constraints enforce required geometric relationships, and the objective function measures layout quality. We present existing research using this framework, describing the kind of optimization problem being solved and the basic optimization techniques used to solve it. Our review focuses on the formatting of primarily textual documents, including both micro-and macro-typographic concerns. We also cover techniques for automatic table layout. Related problems such as widget and diagram layout, as well as temporal layout issues that arise in multimedia documents are outside the scope of this review.

show abstract

Section: Cell-driven Layoutmentioning

confidence: 99%

Section: Cell-driven Layoutmentioning

confidence: 99%

Section: Minimal Configurationsmentioning

confidence: 99%

See 1 more Smart Citation

Review of automatic document formatting

Hurst

Marriott

2009

Proceedings of the 9th ACM Symposium on Document Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…Many approaches to automatic table rely on computing the minimum width for a cell given a particular height. See for instance Wang [8], Anderson and Sobti [2], and our earlier paper [5]. The algorithms given here can be used to efficiently compute such minimal widths for even non-rectangular cells.…”

Section: Introductionmentioning

confidence: 97%

“…Another disadvantage of their algorithm for finding the minimum height for a fixed-width text box is that it is quite complex and, as far as we are aware, has not been implemented. Hurst, Marriott and Moulder [5] give a linear time dynamic programming algorithm for finding the minimum width that will allow the text to be laid out in less lines than the current text configuration. Both Anderson and Sobti and Hurst et al were motivated by table layout and neither consider how to determine the minimum size for non-rectangular text shapes and the algorithms given in their papers do not obviously generalize to this problem.…”

Section: Introductionmentioning

confidence: 99%

Minimum sized text containment shapes

Hurst

Marriott

Moulder

2006

Proceedings of the 2006 ACM Symposium on Document Engineering

Self Cite

View full text Add to dashboard Cite

In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size for such text shapes. A variant of this problem is to take a fixed shape and determine the maximal size font that will still allow the content to fit into it. Our approach is to model the problem as a constrained optimisation problem with a single variable that controls the geometry of the text shape. We use a variant of secant search to determine the minimum area for the shape, guided by the area of the text. We represent the shape by regions that are composed of trapezoids whose coordinates are a linear function of the unknown variable. This allows us to use a novel linear time algorithm (based on computing Minkowski difference) that takes a trapezoid list and text height and determines the region in which a line of text of that height and some minimum width can start and still remain inside the shape.

show abstract

Extensible layout in functional documents

2006

View full text Add to dashboard Cite

Highly customised variable-data documents make automatic layout of the resulting publication hard. Architectures for defining and processing such documents can benefit if the repertoire of layout methods available can be extended smoothly and easily to accommodate new styles of customisation. The Document Description Framework incorporates a model for declarative document layout and processing where documents are treated as functional programs. A canonical XML tree contains nodes describing layout instructions which will modify and combine their children component parts to build sections of the final presentation. Leaf components such as images, vector graphic fragments and text blocks are 'rendered' to make consistent graphical atoms. These parts are then processed by layout agents, described and parameterised by their parent nodes, which can range from simple layouts like translations, flows, encapsulations and tables through to highly complex arrangements such as constraint-solution or pagination. The result then becomes a 'molecule' for processing at a higher level of the layout tree. A variable and reference mechanism is included for resolving rendering interdependency and supporting component reuse. Addition of new layout types involves definition of a new combinator node and attachment of a suitable agent.

show abstract

Toward tighter tables

Cited by 13 publications

References 6 publications

Review of automatic document formatting

Review of automatic document formatting

Minimum sized text containment shapes

Extensible layout in functional documents

Contact Info

Product

Resources

About