Presentation 2003/3/11
A Consideration on an Optimal Partition of a Paragraph into Lines for Desktop Publishing
Joujirou TANI, Genichi OGAWA, Shuji TSUKIYAMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Due to the remarkable progress of desk top publishing techniques, many documents are produced by word-processors or typesetting softwares such as T_EX. However, almost all such programs use criteria based on English documents in partitioning paragraph into lines, so that they sometimes produce inappropriate typesetting for a Japanese document. For example, if each line is short and a paragraph contains a long mathematical equation or foreign word which cannot be divided by hyphenation, a line with large space between characters may be created, which is not suitable to Japanese documents, since the numbers of characters in succeeding lines are to be almost equal in Japanese documents. In this paper, we consider a problem to break a paragraph into lines, and proposes appropriate criteria to Japanese document. The criteria are effective but simple so that the problem can be solved by a shortest path in a acyclic graph.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Desktop publishing / Optimal partition of a paragraph / Japanese document oriented / Acyclic graph / shortest path
Paper # CAS2002-167,DSP2002-242,CS2002-182
Date of Issue

Conference Information
Committee CAS
Conference Date 2003/3/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Circuits and Systems (CAS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Consideration on an Optimal Partition of a Paragraph into Lines for Desktop Publishing
Sub Title (in English)
Keyword(1) Desktop publishing
Keyword(2) Optimal partition of a paragraph
Keyword(3) Japanese document oriented
Keyword(4) Acyclic graph
Keyword(5) shortest path
1st Author's Name Joujirou TANI
1st Author's Affiliation Chuo University Graduate School()
2nd Author's Name Genichi OGAWA
2nd Author's Affiliation Foursis Inc.
3rd Author's Name Shuji TSUKIYAMA
3rd Author's Affiliation Chuo University Graduate School
Date 2003/3/11
Paper # CAS2002-167,DSP2002-242,CS2002-182
Volume (vol) vol.102
Number (no) 716
Page pp.pp.-
#Pages 6
Date of Issue