Tabular formatting problems

DOI10.1007/3-540-63620-X_62MaRDI QIDQ4376806zbMATH OpenFDO

Authors Xinxin Wang, D. Wood

Publication date 11 February 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63620-X_62

zbMATH Keywords

tabular formatting algorithmXTABLE

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computing methodologies for text processing; mathematical typography (68U15) Parallel algorithms in computer science (68W10)

Review text

The paper investigates the computational complexity of tabular formatting problem and proves it to be NP-complete with respect to two useful features: automatic line breaking, and size constraints expressed as linear inequalities. On this basis, the paper proposes a new tabular formatting algorithm which determines in polynomial time the physical dimensions for many tables, although it takes exponential time in the worst case. The authors incorporated their main ideas of the combined tabular formatting algorithm within the XTABLE interactive tabular composition prototype system, running under UNIX and X Windows environment, that optimally generates the table sizes and shapes. For the entire collection see [Zbl 0879.00058].

Recommendations

• Tafel Musik: Formatting algorithm of tables
• Automatic minimal-height table layout
• FITTING A TABLE TO A PAGE USING NONLINEAR OPTIMIZATION
• On the Computational Intractability of Analytic Tableau Methods

Cited in

(6)

• Tafel Musik: Formatting algorithm of tables
• Drawing borders efficiently
• Automatic minimal-height table layout
• FITTING A TABLE TO A PAGE USING NONLINEAR OPTIMIZATION
• Drawing Borders Efficiently
• Chips on wafers, or packing rectangles into grids

This page was built for publication: Tabular formatting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376806)