Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Described herein are systems and methods for modifying electronic books (“eBooks”). A server processes eBook data to determine portions of one or more source fonts comprising various glyphs used in presenting the eBook. An embedded font is generated which includes those portions of the one or more fonts which are used in the particular eBook data. Because the unused portions of the one or more fonts are omitted, the overall size of the embedded fonts may be less than those of the source fonts. A custom character map may be generated as part of the embedded font which provides for increased document security.

Abstract: Systems, methods, and apparatus, including computer program products for text composition are provided. In some implementations, a method is provided. The method includes processing a plurality of paragraphs in parallel, including defining a paragraph layout for each paragraph, the paragraph layout including line breaks. The method further includes composing the text in an electronic document including serially composing each paragraph, the serial composing including shuffling the processed paragraphs into a particular position within a page frame of the electronic document.

Abstract: Techniques are provided for text composition. In some implementations, a computer-implemented method is provided. The method includes receiving text to compose, the text including a plurality of paragraphs, and composing the text using paragraph composition, the paragraph composition determining a layout for the lines of each paragraph according to a line break scheme that determines line breaks for the paragraph as a whole. The method also includes, identifying limited recomposition for one or more paragraphs of the plurality of paragraphs, receiving a modification to a line of a paragraph, the paragraph having a plurality of lines and where the modified line is subsequent to a first line in the paragraph, determining whether the paragraph of the modified line is identified as having limited recomposition and, if the paragraph has limited recomposition, recomposing a portion of the paragraph using a multi-line paragraph composition process without recomposing the full paragraph.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: The invention features systems, methods, and computer program products for typesetting a sequence of character glyphs. In on implementation, the invention provides a spacing classification file for a character set, the classification file being a text file, containing text form definitions of multiple character classes, each character class definition being structured to define a character class as having one or more arbitrary characters, the classification file further containing, in text form, multiple inter-class spacing definitions, each inter-class spacing definition defining, for an order pair of character classes, one or more spacing parameters for the ordered pair and an associated priority for each defined spacing parameter. A line of text can be compressed or expanded according to the inter-class spacing definitions for each sequential pairs of characters in the sequence of characters defined in the classification file according to their respective priorities.

Abstract: The invention features systems, methods, and computer program products for typesetting a sequence of character glyphs. In on implementation, the invention provides a spacing classification file for a character set, the classification file being a text file, containing text form definitions of multiple character classes, each character class definition being structured to define a character class as having one or more arbitrary characters, the classification file further containing, in text form, multiple inter-class spacing definitions, each inter-class spacing definition defining, for an order pair of character classes, one or more spacing parameters for the ordered pair and an associated priority for each defined spacing parameter. A line of text can be compressed or expanded according to the inter-class spacing definitions for each sequential pairs of characters in the sequence of characters defined in the classification file according to their respective priorities.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node (140). For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node (142). Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines (144). The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme (150).

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Method and apparatus, including computer program products, implementing and using techniques for adjusting spacing between characters in a line of text. A plurality of character classes are specified based on user input. A character class from the plurality of character classes is assigned to a character of a pair of characters in the line. Spacing between characters of the pair of characters is adjusted based on the assigned character class. Method and apparatus, including computer program products, implementing and using techniques for selecting rules for spacing adjustment in a line of text, and method and apparatus, including computer program products, implementing and using techniques for evaluating line layout are also described.

Abstract: Method and apparatus, including computer program products, implementing and using techniques for adjusting spacing between characters in a line of text. A plurality of character classes are specified based on user input. A character class from the plurality of character classes is assigned to a character of a pair of characters in the line. Spacing between characters of the pair of characters is adjusted based on the assigned character class. Method and apparatus, including computer program products, implementing and using techniques for selecting rules for spacing adjustment in a line of text, and method and apparatus, including computer program products, implementing and using techniques for evaluating line layout are also described.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Methods and apparatus for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node. For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node. Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines. The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme.

Abstract: Methods and apparatus, for calculating paragraph layout. A method begins with a first node in a paragraph and calculates an optimal line break scheme for paragraph layout that ended in the node (140). For every subsequent node in the paragraph, the method calculates an optimal line break scheme for paragraph layout that ends respectively in every subsequent node (142). Each optimal line break scheme is calculated by minimizing the total of a penalty value of a current line and all preceding penalties of all preceding lines (144). The preceding penalties of all preceding lines are defined by a previously calculated optimal line break scheme (150).