{"title":"关于文本格式中的断行问题","authors":"James O. Achugbue","doi":"10.1145/800209.806462","DOIUrl":null,"url":null,"abstract":"A basic problem in text formatting is that of determining the break points for separating a string of words into lines to obtain a formatted paragraph. When formatted text is required to be aligned with both the left and right margins, the choice of break points greatly affects the quality of the formatted document. This paper presents and discusses solutions to the line breaking problem. These include the usual line-by-line method, a dynamic programming approach, and a new algorithm which is optimal and runs almost as fast as the line-by-line method.","PeriodicalId":315448,"journal":{"name":"SIGPLAN SIGOA Symposium on Text Manipulation","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"On the line breaking problem in text formatting\",\"authors\":\"James O. Achugbue\",\"doi\":\"10.1145/800209.806462\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A basic problem in text formatting is that of determining the break points for separating a string of words into lines to obtain a formatted paragraph. When formatted text is required to be aligned with both the left and right margins, the choice of break points greatly affects the quality of the formatted document. This paper presents and discusses solutions to the line breaking problem. These include the usual line-by-line method, a dynamic programming approach, and a new algorithm which is optimal and runs almost as fast as the line-by-line method.\",\"PeriodicalId\":315448,\"journal\":{\"name\":\"SIGPLAN SIGOA Symposium on Text Manipulation\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1981-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGPLAN SIGOA Symposium on Text Manipulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800209.806462\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGPLAN SIGOA Symposium on Text Manipulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800209.806462","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A basic problem in text formatting is that of determining the break points for separating a string of words into lines to obtain a formatted paragraph. When formatted text is required to be aligned with both the left and right margins, the choice of break points greatly affects the quality of the formatted document. This paper presents and discusses solutions to the line breaking problem. These include the usual line-by-line method, a dynamic programming approach, and a new algorithm which is optimal and runs almost as fast as the line-by-line method.