Approximating text by its area

Authors:
Nathan Hurst;Kim Marriott
Affiliations:
Monash University;Monash University
Venue:
Proceedings of the 2007 ACM symposium on Document engineering
Year:
2007

Citing 5
Cited 4

Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Toward tighter tables

Proceedings of the 2005 ACM symposium on Document engineering
Minimum sized text containment shapes

Proceedings of the 2006 ACM symposium on Document engineering
Solving the simple continuous table layout problem

Proceedings of the 2006 ACM symposium on Document engineering
Automatic float placement in multi-column documents

Proceedings of the 2007 ACM symposium on Document engineering

Satisficing scrolls: a shortcut to satisfactory layout

Proceedings of the eighth ACM symposium on Document engineering
Adaptive video and metadata display using multimedia documents

Proceedings of the 2010 ACM workshop on Social, adaptive and personalized multimedia interaction and access
Typesetting multiple interacting streams

Proceedings of the 2012 ACM symposium on Document engineering
HTML Automatic Table Layout

ACM Transactions on the Web (TWEB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given possibly non-rectangular shapes, S1, ..., Sn, and some English text, T, we give methods based on approximating T by its area that determine for each Si whether T definitely fits in Si, definitely does not fit in Si, or probably fits in Si. These methods have complexity linear in the size of Si, assuming it is represented as a trapezoid list, but do not depend on the size of T. They require a linear time shape independent pre-processing of the text.