US20050286065A1 - Method and system for flowing data to an arbitrary path defined by a page description language - Google Patents

Method and system for flowing data to an arbitrary path defined by a page description language Download PDF

Info

Publication number
US20050286065A1
US20050286065A1 US11/153,256 US15325605A US2005286065A1 US 20050286065 A1 US20050286065 A1 US 20050286065A1 US 15325605 A US15325605 A US 15325605A US 2005286065 A1 US2005286065 A1 US 2005286065A1
Authority
US
United States
Prior art keywords
text
data
path
wrapping
string
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US11/153,256
Inventor
Forrest Gauthier
James Walker
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=27124291&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=US20050286065(A1) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Priority claimed from US08/897,467 external-priority patent/US6209010B1/en
Application filed by Individual filed Critical Individual
Priority to US11/153,256 priority Critical patent/US20050286065A1/en
Publication of US20050286065A1 publication Critical patent/US20050286065A1/en
Assigned to GAUTHIER, FORREST P. reassignment GAUTHIER, FORREST P. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: TESSERON LTD.
Assigned to GAUTHIER, FORREST P. reassignment GAUTHIER, FORREST P. RELEASE BY SECURED PARTY (SEE DOCUMENT FOR DETAILS). Assignors: TESSERON LTD.
Abandoned legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/10Text processing
    • G06F40/103Formatting, i.e. changing of presentation of documents
    • G06F40/106Display of layout of documents; Previewing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/10Text processing
    • G06F40/103Formatting, i.e. changing of presentation of documents
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K15/00Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers
    • G06K15/02Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers using printers
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K15/00Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers
    • G06K15/02Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers using printers
    • G06K15/18Conditioning data for presenting it to the physical printing elements
    • G06K15/1848Generation of the printable image
    • G06K15/1849Generation of the printable image using an intermediate representation, e.g. a list of graphical primitives
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K15/00Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers
    • G06K15/02Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers using printers
    • G06K15/18Conditioning data for presenting it to the physical printing elements
    • G06K15/1848Generation of the printable image
    • G06K15/1856Generation of the printable image characterized by its workflow

Definitions

  • the present invention relates to the high speed printing industry, and more particularly a system and method for flowing variable data into a page description language file in a high speed printing environment.
  • Application programs such as word processors, illustrators, and computer-aided design systems are software packages used to create a document (text and graphics) on a computer screen and to simultaneously generate a page description language (“PDL”) specification, which is to be transferred to the printer or to any other type of raster or output device for creating a hard copy or copies of the document.
  • PDL page description language
  • a PDL specification can be generated by a programmer without the assistance of an application program.
  • the printer executes the PDL specification to generate a bitmap of the document, or a raster-data representation of a document, and eventually transfers the bitmap or raster-data to the physical medium.
  • a typical PDIJ language such as PostScript (a registered trademark of Adobe Corporation) defines a page of the document as containing a number of data areas, where each data area contains either graphic or alpha-numeric data.
  • Each data area is defined by a “graphic state,” which is a collection of parameters for controlling the representation and appearance of text and graphics.
  • the graphic state can include a set of text attributes such as scale-factor, type-font, etc.
  • PDL command used to build a graphic state can be: “twenty rotate,” and “/Times-Roman find font 14 scalefont setfont.”
  • Examples of PDL commands used to define the graphic or alpha-numeric data that is displayed in the data area include: 0 0 moveto and (ABC) show.
  • the entire group of PDL commands used to define a document is hereinafter referred to as the “PDL specification.”
  • each printed document shares a common template and there is at least one area in the template that changes for each printing of the template.
  • Typical PDL languages are not designed for high-speed variable data printing because, with PDL languages and PDL interpreters, even if a single item of data in the document changes, an entirely new PDL specification must be created and interpreted. For example, if one-hundred thousand copies of a mass-mailing advertisement were to printed (i.e., each copy of which is identical except for the mailing address), it is typically necessary to generate a new PDL specification for each copy to printed. Hence, to generate one-hundred thousand advertisements, it would be necessary to generate one-hundred thousand PDTJ specifications, even though each advertisement is virtually the same except for the variable data area. The processing time required to interpret and render one-hundred thousand PDL specifications is enormous, significantly slowing the entire printing system.
  • typical PDL languages do not include any text or data flowing capabilities. These features are usually implemented by the application program, and when such an application program flows data (such as text) into a PDL document, the calculations to determine where to place the data are completed prior to the generation to the PDL specification. Accordingly, variable data cannot be flowed into a template document without creating a new PDL specification for each document. Accordingly, there is a need for a high-speed printing operation having the ability to merge variable data into a template defined by a PDL specification; and in particular, having the ability to flow variable data into a template path defined by PDL specification in a high-speed printing operation.
  • variable data such as text data, image data, bar code data and the like
  • a path of a template defined by a PDL specification in a high-speed printing operation.
  • variable data such as text data, image data, bar code data and the like
  • a further object of the present invention to provide the ability to generate a plurality of merged bitmaps, which are each essentially a copy of a template, except for at least one portion of the template that contains an arbitrary path. In that path, each merged bitmap can contain a different set of variable data merged into it.
  • the template is defined by a page description language, and the page description language only needs to be processed or interpreted once before creating all of the merged bitmaps, thus providing an extremely high-speed variable data printing operation.
  • the computer implemented method for flowing data into an arbitrary path defined by a page description language specification generally comprises the steps of processing (interpreting) the PDL specification to produce a template; designating a path defined in the PDL specification as a wrapping path; associating a block of variable data with the wrapping path; and merging variable data, according to the path boundary and according to a predefined flow rule, into a copy of the template.
  • the method of the present invention is accomplished by executing a control task in conjunction with a PDL interpreter program.
  • the control task generates a template display list based upon the PIDL commands in the PDL specification.
  • the display list includes a plurality of rendering commands, where each rendering command designates a particular data area or object to be rendered, the graphics state to be applied to the data area and the offset address at which the rendered object, if any, in the data area is to be overwritten onto the final bit map.
  • the graphic states for each data area are set forth in the PDL specification, and pertain to the print attributes that describe how particular graphic or alpha-numeric data is to appear on the printed page. These attributes can include the size, font, position, orientation, location, and the like.
  • the control task monitors the data areas defined by the PDI.J specification to watch for variable data paths defined by the PDL code. If the control task identifies a path as being a variable data path, it reserves the graphic-states associated with that variable data path in a cache or memory, and then moves on to the next data area defined in the PDL specification, preferably without allowing the path data to be added to the template display list.
  • the control task saves the template display list in memory without dispatching a bitmap of the template to the printer.
  • a merge task is initiated which accesses a variable data record from a merge file; associates the variable data record to a particular variable data path; creates representations of the variable data, such as rendering commands according to the reserved graphic states pertaining to that particular variable data path, according. to the boundary of the particular variable data path and according to a predefined flow rule; and then generates a merged bitmap by processing the template display list and the variable data rendering commands. The final merged bitmap that may then be dispatched to the printer.
  • This merge task is repeated for each variable data record in the merge file associated with that particular variable data path to create a plurality of the merged bitmaps.
  • the PDL specification of the template need only be interpreted once, saving significant processing time for the variable printing operation, because the reserved graphic states may be utilized over and over again to create the flowed data bitmap for each variable data record contained in the merge file.
  • the characters “ ⁇ ” and “>>” are used as part of a special text string to define an area as a variable data area. And if that special text string also includes the string wrap then the control task will recognize that the very next path command appearing in the PDL specification will be a unique path, in this case a path for flowing variable text bitmaps into.
  • FIG. 1 is a is a schematic, block-diagram representation of a high-speed printing system according to the present invention
  • FIG. 2 is an example of a job ticket file for use with the present invention
  • FIG. 3 is an example of a merge file for use with the present invention.
  • FIG. 4 is a graphical representation of data contained in a PDL specification for use with the present invention.
  • FIG. 5 is a graphical representation of a process step of the present invention operating on data contained in the PDL specification of FIG. 4 ;
  • FIG. 6 is a graphical representation of a process step of the present invention following the process step of FIG. 5 ;
  • FIG. 7 is a graphical representation of a process step of the present invention following the process steps of FIGS. 5 and 6 ;
  • FIG. 8 is a graphical representation of a process step of the present invention following the process steps of FIGS. 5 , and 6 ;
  • FIG. 9 is an example of a merged document created by the process and system of the present invention.
  • FIG. 10 is an example of a merged document created by the process and system of the present invention.
  • FIG. 11 is a flow chart representation of a process of the present invention.
  • FIG. 12 is an example of a merged document created by the process and system of the present invention.
  • FIG. 13 is an example of a merged document created by the process and system of the present invention.
  • a system for performing the method of the present invention includes a printer controller 10 having access to a job ticket file 12 , a page description language (“PDU”) file 14 , a source of variable data such as a merge file 16 , and an optional printer configuration file 18 .
  • the system also contains an operator control terminal 20 for providing operator controls such as indicating the name and location (file-path) of the job ticket file 12 for the specific print job.
  • the job ticket file 12 contains the guidelines for the print job which can include the names and locations of the PDL file(s) 14 , the merge file(s) 16 , the configuration file(s) 18 , etc.; and may also include special instructions pertaining to features such as data wrapping, described below.
  • the PDL file 14 is preferably a PostScript specification created by an application program, such as a word processor, illustrator, or computer-aided design system.
  • the merge file 16 contains platform independent data, such as text data, image data, bar-code data and the like, which is to be merged into a template bitmap defined by the PDL file during the merging task, as will be described in detail below.
  • the configuration file 18 defines the print engines and post processing equipment and other options to be executed.
  • the location and name of the job ticket file 12 is specified by the operator using the operator control terminal 20 .
  • the printer controller 10 retrieves the job ticket file. 12 and then retrieves the PDL files 14 and merge files 16 that are specified in the job ticket file.
  • the controller 10 initiates a control task 22 in conjunction with a page description code interpreter program.
  • the control task interprets the PDL specification from the PDL file 14 and monitors data areas defined in the PDL specification to watch for areas to become variable data areas defined by the specification. If the control task identifies a data area as being a variable data area, it reserves the graphic states 23 of that variable data area in memory 24 and then moves on to the next data area defined by the PDL specification, usually without allowing any data defined by the variable data area to be added to the template bitmap.
  • the control task 22 will also create a font cache (an entire set of character bitmaps generated according to the reserved graphic states) for the reserved graphic states, which will be linked to the reserved graphic states in memory 24 .
  • the control task 22 may also create a template display list 25 of static data defined by the PDL file 14 .
  • the display list 25 will include a plurality of rendering commands, where each rendering command designates a particular static data area or object to be rendered, the graphics state to be applied to the static data area and the offset address at which the rendered object, if any, in the static data area is to be overwritten onto the final bit map.
  • the graphic states for each data area are set forth in the PDL specification, and pertain to the print attributes that describe how particular graphic or alpha-numeric data is to appear on the printed page.
  • a merge task 28 having access to the variable data records 17 from the merge file 16 , is executed to apply the reserved graphics states 23 and associated font cache, to the variable data records 17 , creating rendering commands for that variable data record as defined by the graphic states.
  • the merge task 28 retrieves a copy 25 ′ of the template display list 25 from the memory 26 and merges the variable data rendering commands with the template display list to create a merged display list 30 .
  • the controller 10 performs a rendering task 32 to render the merged display list 30 into a plurality of bitmap bands 34 for dispatching to at least one print engine 36 .
  • a method-for performing the above control task and merge task is described in U.S. patent application Ser. No. 08 ⁇ 373,582 filed Jan. 17; 1995 and entitled “Method of Utilizing Variable Data Fields with a Page Description Language,” the disclosure of which is incorporated herein by reference.
  • a method and a system architecture for performing the above merging, banding and dispatching operations are respectively described in U.S. Pat. No. 5,594,860 and U.S. patent application Ser. No. 08 ⁇ 558,007, filed Nov. 13, 1995, and entitled “System Architecture for Processing and Transporting a Pagemap or Bitmap Data to a Raster Print Engine,” the disclosures of which are also incorporated herein by reference.
  • a preferred embodiment of the present invention is illustrated by way of example in FIGS.
  • the job ticket file 12 can contain a file location statement 38 for determining the location and name of the PDL file, and can contain a file location statement 40 for determining the location and name of the merge file.
  • the job ticket file 12 can also contain a descriptive name of a wrapping path 42 , in this case, named “Shape,” for identifying a name of a wrapping path in the PDL file that is to have variable data flowed into it during the merge task.
  • the variable data to be flowed into the wrapping path text data in this case, will be taken from the file designated by the file location statement 40 of the merge file.
  • the merge file is named “info.text.”
  • the group header 44 “[Wrap]” indicates that the group is defining a wrapping path.
  • a second group header 46 “[Shape]” can be thereafter defined in the job ticket file to provide information about the wrap path; such as defining the fill rule 48 to be used in the wrapping operation, and such as defining a path drawing rule 50 , i.e., whether the path is to be drawn in the final rendered image.
  • Other definable wrapping commands for the particular path “Shape” can include defining the top, bottom or side margins, defining the justification, setting the number of paths to flow the data into, defining an overflow path, etc.
  • the merge file 16 is a platform-independent data file that contains the “variable” data to be merged into the path defined in the PDL specification.
  • the merge file can contain a field name 52 , corresponding to a field name that will be defined in the PDL specification, which is associated with a particular variable data path.
  • the merge file will also contain a number of variable data blocks 54 , text blocks in this case, corresponding to the field name 52 .
  • One variable data block 54 will be merged into the variable data path, defined in the PDL specification, at a time.
  • the designer will utilize an application program to create a document containing a path 56 and attribute data, such as an attribute string 58 , to be associated with the path 56 .
  • the application program will then be directed to create a PDL specification of the document by the designer.
  • the attribute string 58 contains a field name 60 surrounded by special characters, “ ⁇ ” and “>>”, a wrap attribute command string 62 , and a path identifier 63 .
  • the PDL specification generated by the application program will include the graphic states of the attribute string 58 . These graphic states can include the font size (i.e., 10 point), the type-font (i.e., Script) the orientation (i.e., angled upwardly at 500) and the like.
  • control task 22 will execute a PDL interpreter program to interpret the PDL specification created by the application program to generate a template display list 25 of the document, and to also monitor for any variable data paths defined in the PDL specification.
  • the control task 22 monitors for variable data areas defined by the PDL specification by monitoring for special characters in the text strings defined by text commands in the PDL specification. As shown in FIG. 4 , the special characters “ ⁇ ” and “ ⁇ ” surround the field name 60 . The control task, upon identifying the special characters in the text command for the attribute string will thus know that the attribute string 58 is defining a variable data area, and is not merely defining a text string to appear on the printed page (the attribute string will not appear on the final printed page unless the control task is directed to by the job ticket file). The field name 60 surrounded by the special characters identifies the associated field name 52 present in the merge file 16 .
  • the control task will also monitor for the wrap string 62 within the attribute string, which also includes the path identifier string 64 associated therewith. If found, the control task will know that a path defined in the PDL specification that has a predetermined relationship with the text command for the attribute string will be a wrapping path, where the wrapping path has the wrapping attributes defined in the job ticket file 12 for the particular group header 44 and descriptive name of a path 42 matching the path identifier string 63 set forth in the attribute string 58 .
  • the predetermined relationship is satisfied by the first path command to follow the text command for the attribute string in the PDL specification.
  • This can be accomplished by using the application program to sequentially type the attribute string 58 and then draw the path 56 , such that the path command will be the first path command to follow the text command in the PDL specification created by the application program.
  • the predetermined relationship can be satisfied by the path command that is “grouped” with the text command for the attribute string in the PDL specification. This can be accomplished by using a “GROUP” tool as provided by many application programs to group the attribute string 58 and path 56 together. It will be apparent to one of ordinary skill in the art that there are many similar predetermined relationships available between the text command for the attribute string and the path command for the wrapping path that can be established in the PDL specification, all of which fall within the scope of the present invention.
  • the control task 22 will match the wrap attribute command string 62 and path identifier 64 with the group header 44 and descriptive name of the path 42 defined in the job ticket file 12 .
  • the control task will save the graphic states 23 of the attribute string 58 in memory.
  • the control task may also create a font cache according to the graphic states 23 , and store the font cache along with the graphic states in memory 24 .
  • the control task will also save the field name 60 along with the graphic states 23 in memory so that the particular graphic states can be matched to the blocks of text data in the merge file 16 under the matching field name 52 , as will be described below.
  • the merge task 28 will apply these graphic states 23 and associated font cache to the variable data 54 prior to merging and flowing the variable data into the path 56 .
  • control task 22 Once the control task 22 has identified the path as being a variable data path, and has reserved the graphic states 23 of the attribute string 58 associated with the path in memory 24 , the control task 22 advances to the next data area in the PDL specification, preferably without allowing the attribute string data or the path to be added to the template display list 25 stored in memory 26 . And once the PDL interpreter program has completed interpreting the PDL specification, the control task 22 then passes authority to the merge task 28 .
  • the merge task 28 first accesses a set of the saved graphic states 23 and identifies the field name 60 associated with these graphic states.
  • the merge task 28 then accesses the merge file 16 and searches the merge file for a field name 52 matching the field name 60 associated with the graphic states.
  • the merge task then accesses a variable data block 54 associated with the field name 52 and then generates rendering commands for the variable data block according to the graphic states 23 , the predefined flow rule 48 and the boundary of the path 56 .
  • the predefined flow rule 48 may or may not be defined by the job ticket file 12 . Accordingly, when the rendering command is executed the bit map data defined by the rendering command will flow within the path 56 according to a predefined flow rule.
  • a method for merging and flowing the variable text data into the path 56 is as follows: as indicated in step 100 and illustrated in FIG. 5 , preferably the control task will first “flatten” the path, which involves breaking the complex path 56 (which may contain ellipses and curves) into a series of simple straight lines 64 (i.e., converting the path into a series of “move to” and “line to” commands). Each straight line 64 will comprise a particular portion of a boundary 65 , into which the variable data is to be positioned. Alternatively, it is within the scope of the present invention to have the path 56 itself define the boundary into which the variable data is to be positioned.
  • the extent of the boundary may also be defined, in part, by the designation of margins, or the creation of additional paths, etc.
  • a horizontal axis 67 of a coordinate system 69 will be aligned with the attribute string 58 .
  • a new equivalent boundary 65 ′ is created, whose coordinates are those of the original boundary 65 , but rotated into the same coordinate system 69 as the attribute string 58 (for example, as shown in FIG. 5 , the attribute string 58 is rotated a negative 50° in the document, and therefore, in FIG. 6 the boundary 65 ′ is rotated by a positive 50°).
  • the stored graphic states 23 are applied to a variable data block 54 to be merged into the boundary 65 ′ so as to calculate the dimensions of a plurality of word bitmaps, the word bitmaps being defined by a collection of characters separated from the rest of the data by-white space characters (e.g., a space, tab, new line, etc.).
  • the dimensions of paragraphs can be calculated by defining a paragraph as a collection of word bitmaps separated from other paragraphs by “new line” characters. Assuming that the text flow direction will be from top to bottom and left to right, as indicated in step 108 and as illustrated in FIGS.
  • the “top” or highest point 66 of the path 65 ′ is determined and a top margin 68 is applied to the boundary 65 ′ by measuring a distance downward from the highest point 66 of the boundary.
  • the top margin 68 can be pre-defined, defined in the job ticket file 12 , or by any other sufficient means.
  • a rectangular insertion area 70 is defined, having a vertical height corresponding to the calculated vertical height of the bitmap representation of the first word (the point size of the text) to be flowed into the boundary 65 ′, and having a top horizontal border 72 abutting the top margin 68 .
  • this insertion area 70 will be overlaid onto the entire boundary 65 ′ at that present vertical level to establish at least one intersection point 74 .
  • only those areas between adjacent intersection points 74 will be considered valid candidates for receiving the bitmap representations of the text data.
  • intersection points there are more than two intersection points present within insertion area, then the particular flow rule being utilized will determine between which of the intersection points that the bitmap representations of the text data will be inserted. As illustrated in FIGS. 7 and 8 , when only two intersection points are established, the bitmap representations of the text data will typically be inserted therebetween.
  • left and right margins will then be measured inwardly from each of the intersection points 74 to define left and right borders 77 within the insertion area 70 . Between the left and right borders 77 , therefore, is defined a text placement area 78 for merging the bitmap representations of the text data therein.
  • the left and right margins 76 can be pre-defined, defined in the job ticket file 12 , or determined by any other sufficient means.
  • the rendering commands to create the bitmap representations of a word of the text data as merged into the text placement area are created and added to the display list 25 , depending upon whether the calculated width of the bitmap is equal to or less than the available width calculated to remain in the text placement area.
  • the rendering commands will define the proper orientation of the bitmap representation of the word rotated back into the original orientation of the attribute string 58 .
  • bitmap representations of the words “in” and “a” were able to fit therewithin, however, the bitmap representation of the word “world” was too wide for the remaining width. Accordingly, in the final merged bitmap only the bitmaps representing the words “in” and “a” will be rendered into the first text placement area 78 . If no word bitmaps are capable of fitting within the text placement area, then the area is left blank.
  • a line-spacing 79 is measured below the present insertion area and then the next rectangular insertion area 80 is created and overlaid onto the boundary 65 ′ below the line-spacing 79 in the same manner as defined above for the first rectangular insertion area 70 .
  • the merging process for this particular boundary and text block is finished as shown in step 124 . If the insertion area does not extend below the lowest point of the boundary and there are more bitmaps representing words to insert, then the process return ms to step 114 , described above.
  • steps 114 - 122 will be repeated thereafter until step 124 is reached.
  • bitmaps representing the words “world” and “of” were able to be rendered into the second rectangular insertion area 80 and bitmaps representing the words “interactive,” “media” and “and” were able to rendered into third rectangular insertion area 82 .
  • the merge task will then search for additional variable data areas or variable data paths in which to merge variable data blocks. If no more of such variable data areas or variable data paths exist for the particular document, then the merged display list 30 is transferred to the rendering task 32 , as described above, to generate the bitmap bands 34 for printing.
  • FIG. 8 bitmaps representing the words “world” and “of” were able to be rendered into the second rectangular insertion area 80 and bitmaps representing the words “interactive,” “media” and “and” were able to rendered into third rectangular insertion area 82 .
  • the merge task will then search for additional variable data areas or variable data paths in which to merge variable data blocks. If no more of such variable data areas or variable data
  • FIG. 9 illustrates the entire block of text 54 from the merge file 16 formatted according to the above process and merged into the path 56 to create a first finished document 84 .
  • FIG. 10 illustrates the appearance of the next block of text 54 ′ from the merge file 16 formatted according to the above process and merged into the path 56 to create a second finished document 86 .
  • the height of the rectangular insertion area is determined by the dimensions calculated for the first word bitmap. And if, for whatever reason, a next word bitmap is calculated to be higher than the first or previous word bitmap, and higher than all other word bitmaps inserted thus far into a particular text placement area, then the entire rectangular insertion area is thrown out, and steps 116 and 118 are repeated again for the higher rectangular insertion area generated according to this higher word bitmap. As discussed above, a number fill rules are available for flowing the word bitmaps into the boundary.
  • the merge task can mark the path intersections 74 as “positive,” “negative” or “neutral” based upon whether the path enters and 14aves from the top or the bottom of the insertion area, or whether it enters and exits the insertion area from the same direction. All of the available fill rules will be apparent to one of ordinary skill in the art, and are thus within the scope of the present invention.
  • the two flow paths are the circle and square paths, designated as numerals 88 and 90 , respectively; then the two paths essentially comprise one boundary, and text will flow directly from the circle path 88 into the square path 90 .
  • the 2nd through 8th lines of text flow from the circle path 88 directly into the square path 90 .
  • the flowing operation stops because the area within the two flow paths have been used up. Accordingly, as illustrated in FIG.
  • Each tag that appears under this [Wrap] group will optionally become a new group name in a succeeding section of the Job Ticket.
  • a user-defined tag name for a group that provides information about the wrap path and corresponds to the descriptive tag that you create under the initial [Wrap] group.
  • Baseline Adjust ⁇ BaseAdjustNum> ⁇ Unit Type> See Also Paragraph Adjust, Enforce Paragraph Spacing. Remarks Optional.
  • the process will space successive text lines at 120% of the font size.
  • a 12-point font will have the next baseline set at 14.4 points (120% ⁇ 12) from the previous baseline.
  • the Baseline Adjust element defines an offset from this default value.
  • a positive Baseline Adjust value increases the space between each baseline of text (essentially, moving the next line of text down).
  • a negative value decreases the space between each baseline of text (essentially, moving the next line of text up).
  • BottomMargin ⁇ Bottom Margin Num> ⁇ Unit Type> See Also Margins, Overflow. Remarks Options.
  • the path will have 0.1-inch margins on the top, left, and right sides but will have a 2-inch margin on the bottom side.
  • ClobberPath is set to True, text is flowed across the two adjacent ON areas as if they were one area. In this case, only the “outer” margins of the combined areas would be recognized. Text flow would be continuous across the “inner” margins where the path segment intersects the adjacent areas.
  • ClobberPath is set to False, text is flowed separately into each Area.
  • ClobberPath The default value of ClobberPath is True.
  • this element determines how the blank paragraphs are to be handled.
  • Text is flowed into an area enclosed by (“inside”) the current path. If a path is simple, it is clear which areas are inside the path. However, if a path is complex (for example, intersecting itself or having one subpath that encloses another), it is not as apparent which areas are inside. One of two fill rules will be used to determine which areas lie inside a path.
  • the FillRule element defines if the non-zero winding rule (WindingRule) or the even-odd rule (EvenOddRule) will be used for the current path.
  • the non-zero winding rule determines whether a given area along the proposed flow line is inside the path (and thus receives text) by examining the places where a path segment crosses the flow line.
  • Path segments that cross (intersect) the flow line from top to bottom are given a direction of 1.
  • Path segments that cross (intersect) the flow line from bottom to top are given a direction of ⁇ 1.
  • Path segments that do not fully cross the flow line are given a direction of zero.
  • An on-going sum of all crossings is calculated from left to right. If the sum of all crossings to that point is zero, the area (immediately to the right) is outside the path. If the sum is non-zero, the area is inside the path and will receive text.
  • the even-odd rule determines whether a given area long the proposed flow line is inside the path (and thus receives text) by counting the number of times a path segment crosses the flow line. Path segments that fully cross (intersect) the flow line are given a score of 1. Path segments that do not fully cross the flow line are given a score of zero.
  • An on-going sum of all crossings is calculated from left to right. If the sum of all crossings to that point is even, the area (immediately to the right) is outside the path. If the sum is odd, the area is inside the path and will receive text.
  • the default value for FillRule is WindingRule.
  • winding rule will determine which areas lie inside a path, type WindingRule.
  • the path will have 1-inch margins on the bottom, top, and right sides but will have a 2-inch margin on the left side.
  • a default value for LeftMargin is 0.
  • the path will have 1-inch margins on the bottom, left, and right sides but will have a 2-inch margin on the top.
  • MinParagraphLines ⁇ MinLinesNum> See Also NumberOfPaths, Overflow. Remarks Optional.
  • MinParagraphLines The default value for MinParagraphLines is 1.
  • This element is used to combine multiple paths drawn on the template, and to.treat them as a single path.
  • the path to be combined will be determined—by the order in which they were drawn.
  • the default value for NumberOfPaths is 1.
  • This element defines the use of an overflow feature. When overflow is available, if the current path has no more space into which text can flow, the text will continue to flow into the path named in this element.
  • the system will assume that no overflow will occur for the current path being described. Therefore, text will flow into the current path until it is filled. No overflow text will be printed.
  • the ParagraphAdjust value overrides the Baseline Adjust value only for the first baseline of text in each paragraph.
  • a position ParagraphAdjust value increases the vertical space between the last baseline of text in each paragraph and the start of the next paragraph (essentially, moving the start of the next paragraph down).
  • a negative value decreases the vertical space between the last baseline of text in each paragraph and the start of the next paragraph (essentially, moving the start of the next paragraph up).
  • ParagraphIndent ⁇ ParagraphIndentNum> ⁇ UnitType> See Also ParagraphAdjust Remarks Optional. The default value for ParagraphIndent is 0.
  • the path will have 1-inch margins on the bottom, left, and right sides but will have a 2-inch margin on the top side.

Abstract

A method for wrapping data to an arbitrary path defined by a page description language, including the steps of: (a) processing a page description language specification; (b) while performing step (a), identifying a data wrapping boundary; (c) associating a data block external to the page description language specification with the data wrapping boundary; and (d) generating printable image representations of the data block according to the data wrapping boundary and a pre-defined flow rule.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • This application is a continuation of U.S. patent application Ser. No. 10/629,338 filed on Jul. 29, 2003, now U.S. Pat. No. ______, which was a continuation of U.S. patent application Ser. No. 09/818,665 filed on Mar. 27, 2001, now U.S. Pat. No. 6,487,568, which was a continuation-in-part of U.S. patent application Ser. No. 08/897,467, filed on Jul. 18, 1997, now, U.S. Pat. No. 6,209,010. The disclosure of each of these applications and patents is hereby incorporated by reference.
  • BACKGROUND
  • The present invention relates to the high speed printing industry, and more particularly a system and method for flowing variable data into a page description language file in a high speed printing environment.
  • Application programs, such as word processors, illustrators, and computer-aided design systems are software packages used to create a document (text and graphics) on a computer screen and to simultaneously generate a page description language (“PDL”) specification, which is to be transferred to the printer or to any other type of raster or output device for creating a hard copy or copies of the document. Alternatively, a PDL specification can be generated by a programmer without the assistance of an application program.
  • The printer executes the PDL specification to generate a bitmap of the document, or a raster-data representation of a document, and eventually transfers the bitmap or raster-data to the physical medium. A typical PDIJ language, such as PostScript (a registered trademark of Adobe Corporation) defines a page of the document as containing a number of data areas, where each data area contains either graphic or alpha-numeric data. Each data area is defined by a “graphic state,” which is a collection of parameters for controlling the representation and appearance of text and graphics. For example, the graphic state can include a set of text attributes such as scale-factor, type-font, etc. In PostScript, an example of a PDL command used to build a graphic state can be: “twenty rotate,” and “/Times-Roman find font 14 scalefont setfont.” Examples of PDL commands used to define the graphic or alpha-numeric data that is displayed in the data area include: 0 0 moveto and (ABC) show. The entire group of PDL commands used to define a document is hereinafter referred to as the “PDL specification.”
  • In variable data printing each printed document shares a common template and there is at least one area in the template that changes for each printing of the template. Typical PDL languages are not designed for high-speed variable data printing because, with PDL languages and PDL interpreters, even if a single item of data in the document changes, an entirely new PDL specification must be created and interpreted. For example, if one-hundred thousand copies of a mass-mailing advertisement were to printed (i.e., each copy of which is identical except for the mailing address), it is typically necessary to generate a new PDL specification for each copy to printed. Hence, to generate one-hundred thousand advertisements, it would be necessary to generate one-hundred thousand PDTJ specifications, even though each advertisement is virtually the same except for the variable data area. The processing time required to interpret and render one-hundred thousand PDL specifications is enormous, significantly slowing the entire printing system.
  • Furthermore, typical PDL languages do not include any text or data flowing capabilities. These features are usually implemented by the application program, and when such an application program flows data (such as text) into a PDL document, the calculations to determine where to place the data are completed prior to the generation to the PDL specification. Accordingly, variable data cannot be flowed into a template document without creating a new PDL specification for each document. Accordingly, there is a need for a high-speed printing operation having the ability to merge variable data into a template defined by a PDL specification; and in particular, having the ability to flow variable data into a template path defined by PDL specification in a high-speed printing operation.
  • SUMMARY
  • It is an object of the present invention to provide a system and method for flowing variable data (such as text data, image data, bar code data and the like) into a path of a template defined by a PDL specification in a high-speed printing operation. It is a further object of the present invention to provide the ability to generate a plurality of merged bitmaps, which are each essentially a copy of a template, except for at least one portion of the template that contains an arbitrary path. In that path, each merged bitmap can contain a different set of variable data merged into it. The template is defined by a page description language, and the page description language only needs to be processed or interpreted once before creating all of the merged bitmaps, thus providing an extremely high-speed variable data printing operation.
  • The computer implemented method for flowing data into an arbitrary path defined by a page description language specification (“PDL specification”) generally comprises the steps of processing (interpreting) the PDL specification to produce a template; designating a path defined in the PDL specification as a wrapping path; associating a block of variable data with the wrapping path; and merging variable data, according to the path boundary and according to a predefined flow rule, into a copy of the template.
  • The method of the present invention is accomplished by executing a control task in conjunction with a PDL interpreter program. The control task generates a template display list based upon the PIDL commands in the PDL specification. The display list includes a plurality of rendering commands, where each rendering command designates a particular data area or object to be rendered, the graphics state to be applied to the data area and the offset address at which the rendered object, if any, in the data area is to be overwritten onto the final bit map. The graphic states for each data area are set forth in the PDL specification, and pertain to the print attributes that describe how particular graphic or alpha-numeric data is to appear on the printed page. These attributes can include the size, font, position, orientation, location, and the like.
  • The control task, during the PDL interpretation procedure, monitors the data areas defined by the PDI.J specification to watch for variable data paths defined by the PDL code. If the control task identifies a path as being a variable data path, it reserves the graphic-states associated with that variable data path in a cache or memory, and then moves on to the next data area defined in the PDL specification, preferably without allowing the path data to be added to the template display list.
  • Once the interpreter program completes its interpretation of the PDL specification, the control task saves the template display list in memory without dispatching a bitmap of the template to the printer. Subsequently, a merge task is initiated which accesses a variable data record from a merge file; associates the variable data record to a particular variable data path; creates representations of the variable data, such as rendering commands according to the reserved graphic states pertaining to that particular variable data path, according. to the boundary of the particular variable data path and according to a predefined flow rule; and then generates a merged bitmap by processing the template display list and the variable data rendering commands. The final merged bitmap that may then be dispatched to the printer. This merge task is repeated for each variable data record in the merge file associated with that particular variable data path to create a plurality of the merged bitmaps. Thus, the PDL specification of the template need only be interpreted once, saving significant processing time for the variable printing operation, because the reserved graphic states may be utilized over and over again to create the flowed data bitmap for each variable data record contained in the merge file.
  • How the control task identifies a particular PDL path defined in the PDL specification as being unique, i.e., as being identified as a wrapping path, is an important step in the above process. This is accomplished by providing a text command in the PDL specification that defines one or more characters that are recognized by the control task as being special characters, as opposed to merely being characters that are to be included on the printed page. The control task monitors all text strings defined by the PDL specification for such special characters, and responsive to a detection of the special character in the text string defined by the text command, the control task identifies the path command that has a predetermined relationship with the text command in the PDL specification. This predetermined relationship can be satisfied by the first path command to follow the text command in the PDL specification or by the path command that is “grouped” with the text command in the PDTJ specification.
  • In the preferred embodiment of the present invention, the characters “<<” and “>>” are used as part of a special text string to define an area as a variable data area. And if that special text string also includes the string wrap then the control task will recognize that the very next path command appearing in the PDL specification will be a unique path, in this case a path for flowing variable text bitmaps into.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a is a schematic, block-diagram representation of a high-speed printing system according to the present invention;
  • FIG. 2 is an example of a job ticket file for use with the present invention;
  • FIG. 3 is an example of a merge file for use with the present invention;
  • FIG. 4 is a graphical representation of data contained in a PDL specification for use with the present invention;
  • FIG. 5 is a graphical representation of a process step of the present invention operating on data contained in the PDL specification of FIG. 4;
  • FIG. 6 is a graphical representation of a process step of the present invention following the process step of FIG. 5;
  • FIG. 7 is a graphical representation of a process step of the present invention following the process steps of FIGS. 5 and 6;
  • FIG. 8 is a graphical representation of a process step of the present invention following the process steps of FIGS. 5, and 6;
  • FIG. 9 is an example of a merged document created by the process and system of the present invention;
  • FIG. 10 is an example of a merged document created by the process and system of the present invention;
  • FIG. 11 is a flow chart representation of a process of the present invention;
  • FIG. 12 is an example of a merged document created by the process and system of the present invention; and
  • FIG. 13 is an example of a merged document created by the process and system of the present invention.
  • DETAILED DESCRIPTION
  • As shown in FIG. 1, a system for performing the method of the present invention includes a printer controller 10 having access to a job ticket file 12, a page description language (“PDU”) file 14, a source of variable data such as a merge file 16, and an optional printer configuration file 18. The system also contains an operator control terminal 20 for providing operator controls such as indicating the name and location (file-path) of the job ticket file 12 for the specific print job.
  • The job ticket file 12 contains the guidelines for the print job which can include the names and locations of the PDL file(s) 14, the merge file(s) 16, the configuration file(s) 18, etc.; and may also include special instructions pertaining to features such as data wrapping, described below. The PDL file 14 is preferably a PostScript specification created by an application program, such as a word processor, illustrator, or computer-aided design system. The merge file 16 contains platform independent data, such as text data, image data, bar-code data and the like, which is to be merged into a template bitmap defined by the PDL file during the merging task, as will be described in detail below. The configuration file 18 defines the print engines and post processing equipment and other options to be executed.
  • Initially, the location and name of the job ticket file 12 is specified by the operator using the operator control terminal 20. The printer controller 10 retrieves the job ticket file. 12 and then retrieves the PDL files 14 and merge files 16 that are specified in the job ticket file. Next the controller 10 initiates a control task 22 in conjunction with a page description code interpreter program.
  • The control task interprets the PDL specification from the PDL file 14 and monitors data areas defined in the PDL specification to watch for areas to become variable data areas defined by the specification. If the control task identifies a data area as being a variable data area, it reserves the graphic states 23 of that variable data area in memory 24 and then moves on to the next data area defined by the PDL specification, usually without allowing any data defined by the variable data area to be added to the template bitmap. Preferably, the control task 22 will also create a font cache (an entire set of character bitmaps generated according to the reserved graphic states) for the reserved graphic states, which will be linked to the reserved graphic states in memory 24. Once the control task completes its processing of the PDL specification, the control task saves the template bitmap in memory 26.
  • The control task 22 may also create a template display list 25 of static data defined by the PDL file 14. The display list 25 will include a plurality of rendering commands, where each rendering command designates a particular static data area or object to be rendered, the graphics state to be applied to the static data area and the offset address at which the rendered object, if any, in the static data area is to be overwritten onto the final bit map. As mentioned above, the graphic states for each data area are set forth in the PDL specification, and pertain to the print attributes that describe how particular graphic or alpha-numeric data is to appear on the printed page. Once the control task completes its processing of the PDL specification, the control task may save the template display list 25 in memory 26. If the PDL-file 14 does not include code for any static data, the control task may generate an empty template display list 25 or may decide not to create a template display list at all.
  • Next, a merge task 28, having access to the variable data records 17 from the merge file 16, is executed to apply the reserved graphics states 23 and associated font cache, to the variable data records 17, creating rendering commands for that variable data record as defined by the graphic states. The merge task 28 retrieves a copy 25′ of the template display list 25 from the memory 26 and merges the variable data rendering commands with the template display list to create a merged display list 30. Finally, the controller 10 performs a rendering task 32 to render the merged display list 30 into a plurality of bitmap bands 34 for dispatching to at least one print engine 36.
  • A method-for performing the above control task and merge task is described in U.S. patent application Ser. No. 08\373,582 filed Jan. 17; 1995 and entitled “Method of Utilizing Variable Data Fields with a Page Description Language,” the disclosure of which is incorporated herein by reference. A method and a system architecture for performing the above merging, banding and dispatching operations are respectively described in U.S. Pat. No. 5,594,860 and U.S. patent application Ser. No. 08\558,007, filed Nov. 13, 1995, and entitled “System Architecture for Processing and Transporting a Pagemap or Bitmap Data to a Raster Print Engine,” the disclosures of which are also incorporated herein by reference. A preferred embodiment of the present invention is illustrated by way of example in FIGS. 2-10. As illustrated in FIG. 2, the job ticket file 12 can contain a file location statement 38 for determining the location and name of the PDL file, and can contain a file location statement 40 for determining the location and name of the merge file. The job ticket file 12 can also contain a descriptive name of a wrapping path 42, in this case, named “Shape,” for identifying a name of a wrapping path in the PDL file that is to have variable data flowed into it during the merge task. The variable data to be flowed into the wrapping path, text data in this case, will be taken from the file designated by the file location statement 40 of the merge file. In this case the merge file is named “info.text.” The group header 44 “[Wrap]” indicates that the group is defining a wrapping path. After the wrapping path “Shape” has been defined in the job ticket file, a second group header 46 “[Shape]” can be thereafter defined in the job ticket file to provide information about the wrap path; such as defining the fill rule 48 to be used in the wrapping operation, and such as defining a path drawing rule 50, i.e., whether the path is to be drawn in the final rendered image. Other definable wrapping commands for the particular path “Shape” can include defining the top, bottom or side margins, defining the justification, setting the number of paths to flow the data into, defining an overflow path, etc. A complete description of the different elements that can be defined for the wrapping path in the job ticket file is described in detail in the Appendix, below.
  • As illustrated in FIG. 3, the merge file 16 is a platform-independent data file that contains the “variable” data to be merged into the path defined in the PDL specification. The merge file can contain a field name 52, corresponding to a field name that will be defined in the PDL specification, which is associated with a particular variable data path. The merge file will also contain a number of variable data blocks 54, text blocks in this case, corresponding to the field name 52. One variable data block 54 will be merged into the variable data path, defined in the PDL specification, at a time.
  • As illustrated in FIG. 4, the designer will utilize an application program to create a document containing a path 56 and attribute data, such as an attribute string 58, to be associated with the path 56. The application program will then be directed to create a PDL specification of the document by the designer. The attribute string 58 contains a field name 60 surrounded by special characters, “<<” and “>>”, a wrap attribute command string 62, and a path identifier 63. The PDL specification generated by the application program will include the graphic states of the attribute string 58. These graphic states can include the font size (i.e., 10 point), the type-font (i.e., Script) the orientation (i.e., angled upwardly at 500) and the like.
  • As discussed above, and referring again to FIGS. 1-4, the control task 22 will execute a PDL interpreter program to interpret the PDL specification created by the application program to generate a template display list 25 of the document, and to also monitor for any variable data paths defined in the PDL specification.
  • In the preferred embodiment, the control task 22 monitors for variable data areas defined by the PDL specification by monitoring for special characters in the text strings defined by text commands in the PDL specification. As shown in FIG. 4, the special characters “<<” and “<<” surround the field name 60. The control task, upon identifying the special characters in the text command for the attribute string will thus know that the attribute string 58 is defining a variable data area, and is not merely defining a text string to appear on the printed page (the attribute string will not appear on the final printed page unless the control task is directed to by the job ticket file). The field name 60 surrounded by the special characters identifies the associated field name 52 present in the merge file 16. During the processing of the text command for the attribute string 58, the control task will also monitor for the wrap string 62 within the attribute string, which also includes the path identifier string 64 associated therewith. If found, the control task will know that a path defined in the PDL specification that has a predetermined relationship with the text command for the attribute string will be a wrapping path, where the wrapping path has the wrapping attributes defined in the job ticket file 12 for the particular group header 44 and descriptive name of a path 42 matching the path identifier string 63 set forth in the attribute string 58.
  • Preferably, the predetermined relationship is satisfied by the first path command to follow the text command for the attribute string in the PDL specification. This can be accomplished by using the application program to sequentially type the attribute string 58 and then draw the path 56, such that the path command will be the first path command to follow the text command in the PDL specification created by the application program. Alternatively the predetermined relationship can be satisfied by the path command that is “grouped” with the text command for the attribute string in the PDL specification. This can be accomplished by using a “GROUP” tool as provided by many application programs to group the attribute string 58 and path 56 together. It will be apparent to one of ordinary skill in the art that there are many similar predetermined relationships available between the text command for the attribute string and the path command for the wrapping path that can be established in the PDL specification, all of which fall within the scope of the present invention.
  • Thus, during the execution of the PDL interpreter program, the control task 22 will match the wrap attribute command string 62 and path identifier 64 with the group header 44 and descriptive name of the path 42 defined in the job ticket file 12. Once the attribute string 58 is identified as defining a variable data path by the control task 22, the control task will save the graphic states 23 of the attribute string 58 in memory. The control task may also create a font cache according to the graphic states 23, and store the font cache along with the graphic states in memory 24. The control task will also save the field name 60 along with the graphic states 23 in memory so that the particular graphic states can be matched to the blocks of text data in the merge file 16 under the matching field name 52, as will be described below. The merge task 28 will apply these graphic states 23 and associated font cache to the variable data 54 prior to merging and flowing the variable data into the path 56.
  • Once the control task 22 has identified the path as being a variable data path, and has reserved the graphic states 23 of the attribute string 58 associated with the path in memory 24, the control task 22 advances to the next data area in the PDL specification, preferably without allowing the attribute string data or the path to be added to the template display list 25 stored in memory 26. And once the PDL interpreter program has completed interpreting the PDL specification, the control task 22 then passes authority to the merge task 28.
  • The merge task 28 first accesses a set of the saved graphic states 23 and identifies the field name 60 associated with these graphic states. The merge task 28 then accesses the merge file 16 and searches the merge file for a field name 52 matching the field name 60 associated with the graphic states. The merge task then accesses a variable data block 54 associated with the field name 52 and then generates rendering commands for the variable data block according to the graphic states 23, the predefined flow rule 48 and the boundary of the path 56. The predefined flow rule 48, may or may not be defined by the job ticket file 12. Accordingly, when the rendering command is executed the bit map data defined by the rendering command will flow within the path 56 according to a predefined flow rule.
  • As shown in FIG. 11, and as illustrated in FIGS. 5-10, a method for merging and flowing the variable text data into the path 56 is as follows: as indicated in step 100 and illustrated in FIG. 5, preferably the control task will first “flatten” the path, which involves breaking the complex path 56 (which may contain ellipses and curves) into a series of simple straight lines 64 (i.e., converting the path into a series of “move to” and “line to” commands). Each straight line 64 will comprise a particular portion of a boundary 65, into which the variable data is to be positioned. Alternatively, it is within the scope of the present invention to have the path 56 itself define the boundary into which the variable data is to be positioned. As will be described below, the extent of the boundary may also be defined, in part, by the designation of margins, or the creation of additional paths, etc. As indicated in step 102 and as also illustrated in FIG. 5, a horizontal axis 67 of a coordinate system 69 will be aligned with the attribute string 58. As indicated in step 104 and as illustrated in FIG. 6, a new equivalent boundary 65′ is created, whose coordinates are those of the original boundary 65, but rotated into the same coordinate system 69 as the attribute string 58 (for example, as shown in FIG. 5, the attribute string 58 is rotated a negative 50° in the document, and therefore, in FIG. 6 the boundary 65′ is rotated by a positive 50°).
  • As indicated in step 106, the stored graphic states 23 (e.g., font-type and point size) are applied to a variable data block 54 to be merged into the boundary 65′ so as to calculate the dimensions of a plurality of word bitmaps, the word bitmaps being defined by a collection of characters separated from the rest of the data by-white space characters (e.g., a space, tab, new line, etc.). The dimensions of paragraphs can be calculated by defining a paragraph as a collection of word bitmaps separated from other paragraphs by “new line” characters. Assuming that the text flow direction will be from top to bottom and left to right, as indicated in step 108 and as illustrated in FIGS. 7 and 8, the “top” or highest point 66 of the path 65′ is determined and a top margin 68 is applied to the boundary 65′ by measuring a distance downward from the highest point 66 of the boundary. The top margin 68 can be pre-defined, defined in the job ticket file 12, or by any other sufficient means.
  • As indicated in step 110 and illustrated in FIGS. 7 and 8, a rectangular insertion area 70 is defined, having a vertical height corresponding to the calculated vertical height of the bitmap representation of the first word (the point size of the text) to be flowed into the boundary 65′, and having a top horizontal border 72 abutting the top margin 68. As indicated in step 112, this insertion area 70 will be overlaid onto the entire boundary 65′ at that present vertical level to establish at least one intersection point 74. As indicated in step 114, only those areas between adjacent intersection points 74 will be considered valid candidates for receiving the bitmap representations of the text data. If there are more than two intersection points present within insertion area, then the particular flow rule being utilized will determine between which of the intersection points that the bitmap representations of the text data will be inserted. As illustrated in FIGS. 7 and 8, when only two intersection points are established, the bitmap representations of the text data will typically be inserted therebetween.
  • Once two adjacent intersection points 74 are determined to be candidates for receiving bitmap representations of the text data, as indicated in step 116 and illustrated in FIG. 8, left and right margins will then be measured inwardly from each of the intersection points 74 to define left and right borders 77 within the insertion area 70. Between the left and right borders 77, therefore, is defined a text placement area 78 for merging the bitmap representations of the text data therein. The left and right margins 76 can be pre-defined, defined in the job ticket file 12, or determined by any other sufficient means.
  • As indicated in step 118, the rendering commands to create the bitmap representations of a word of the text data as merged into the text placement area are created and added to the display list 25, depending upon whether the calculated width of the bitmap is equal to or less than the available width calculated to remain in the text placement area. The rendering commands will define the proper orientation of the bitmap representation of the word rotated back into the original orientation of the attribute string 58.
  • As illustrated in FIG. 8, in the first text placement area 78, bitmap representations of the words “in” and “a” were able to fit therewithin, however, the bitmap representation of the word “world” was too wide for the remaining width. Accordingly, in the final merged bitmap only the bitmaps representing the words “in” and “a” will be rendered into the first text placement area 78. If no word bitmaps are capable of fitting within the text placement area, then the area is left blank.
  • As indicated in step 120 and illustrated in FIG. 8, a line-spacing 79 is measured below the present insertion area and then the next rectangular insertion area 80 is created and overlaid onto the boundary 65′ below the line-spacing 79 in the same manner as defined above for the first rectangular insertion area 70. As indicated in step 122, if the new insertion area extends below the lowest point of the boundary 65′ (or below the bottom margin) or if there are no more words to insert, then the merging process for this particular boundary and text block is finished as shown in step 124. If the insertion area does not extend below the lowest point of the boundary and there are more bitmaps representing words to insert, then the process return ms to step 114, described above. Essentially, steps 114-122 will be repeated thereafter until step 124 is reached. As illustrated in FIG. 8, bitmaps representing the words “world” and “of” were able to be rendered into the second rectangular insertion area 80 and bitmaps representing the words “interactive,” “media” and “and” were able to rendered into third rectangular insertion area 82. Subsequent to step 122, the merge task will then search for additional variable data areas or variable data paths in which to merge variable data blocks. If no more of such variable data areas or variable data paths exist for the particular document, then the merged display list 30 is transferred to the rendering task 32, as described above, to generate the bitmap bands 34 for printing. FIG. 9 illustrates the entire block of text 54 from the merge file 16 formatted according to the above process and merged into the path 56 to create a first finished document 84. FIG. 10 illustrates the appearance of the next block of text 54′ from the merge file 16 formatted according to the above process and merged into the path 56 to create a second finished document 86.
  • Preferably, in the above step 118, the height of the rectangular insertion area is determined by the dimensions calculated for the first word bitmap. And if, for whatever reason, a next word bitmap is calculated to be higher than the first or previous word bitmap, and higher than all other word bitmaps inserted thus far into a particular text placement area, then the entire rectangular insertion area is thrown out, and steps 116 and 118 are repeated again for the higher rectangular insertion area generated according to this higher word bitmap. As discussed above, a number fill rules are available for flowing the word bitmaps into the boundary. Accordingly, the merge task can mark the path intersections 74 as “positive,” “negative” or “neutral” based upon whether the path enters and 14aves from the top or the bottom of the insertion area, or whether it enters and exits the insertion area from the same direction. All of the available fill rules will be apparent to one of ordinary skill in the art, and are thus within the scope of the present invention.
  • As discussed above, text flowing into the boundary 65′ will continue until it is determined that there are no more word bitmaps to flow into the boundary or until it is determined that there is no more text areas available to flow the word bitmaps into. In the case of the latter, it is within the scope of the invention to define a path as an “overflow” path for continuing the flowing of the text therein, until this overflow path nuns out of room. This overflowing process can continue until once again it is determined that there are no more text areas to flow text into. Text can also flowed into more than one path at a time.
  • For illustration, as shown in FIG. 12, if the job ticket file defines the number of flow paths as two, and the two flow paths are the circle and square paths, designated as numerals 88 and 90, respectively; then the two paths essentially comprise one boundary, and text will flow directly from the circle path 88 into the square path 90. Note that the 2nd through 8th lines of text flow from the circle path 88 directly into the square path 90. But when the text reaches the end of the square path 90, the flowing operation stops because the area within the two flow paths have been used up. Accordingly, as illustrated in FIG. 13, if an “overflow path” is designated in the job ticket file to be the triangle path 92, the text flowing will continue into the triangle path 92 until there is no more text to be merged or until the path runs out of additional room. Accordingly, the present invention provides capability of identifying particular paths defined in a page description language as data flowing paths, and provides the capability for flowing data within such paths. In addition, the present invention allows the user to specify margin, paragraph formatting, fill rules, and justification parameters on a path by path basis.
  • Having described the invention in detail and by reference to the drawings, it will be apparent to one of ordinary skill in the art that variations and modifications are possible without departing from the scope of the invention as defined on the following claims.
  • The following appendix provides a preferred compilation of text wrapping commands and parameter definitions that can be specified in the job ticket file 12. Each entry provides the particular command header, the syntax for the command, any relevant remarks for the use of the command, examples, etc. As will be apparent to one of ordinary skill in the art, it is within the scope of the present invention to include the means to provide for any of the attributes, or similar attributes, as defined in the Appendix.
  • APPENDIX
  • Command Header=[Wrap]
  • A group that provides a list of tags which you create to describe the text flowing (wrap) path(s) to be used in the print job. Each tag will become a user-defined group of additional information about the wrap path.
  • Syntax [Wrap]
      • <Path Tag X>
      • <Path Tag Y>
      • <Path Tag Z>
  • Remarks Optional. Each tag that appears under this [Wrap] group will optionally become a new group name in a succeeding section of the Job Ticket.
  • Explanation <Path Tax X>
  • Create a descriptive name for a wrap path used in the print job.
  • [00551 Note: Fields on a template that you wish to be flowed into a particular path will use a field attribute of the format:
      • <<fieldname>>wrap=<name>
  • The <name> argument of the wrap attribute must match a path tag listed in the [Wrap] group.
  • Example [Wrap]
      • Circle
      • Square
      • Triangle
  • Command Header=[<Path Tag>]
  • A user-defined tag name for a group that provides information about the wrap path and corresponds to the descriptive tag that you create under the initial [Wrap] group.
  • Syntax [<Path Tag>]
      • Baseline Adjust=
      • Bottom Margin=
      • Clobber Path=
      • Draw Path=
      • Enforce paragraph Spacing=
      • Fill Rule=
      • Fit Last Name=
      • Justify=
      • Left Margin—
      • Margins=
      • Mm Paragraph Lines=
      • Number Of Paths=
      • Overflow=
      • Paragraph Adjust=
      • Reverse Flow=
      • Reverse Path=
      • Right Margin=
      • Top Margin=
  • Remarks A separate [<Path>] group defines path information for each descriptive tag listed under the initial [Wrap] group.
  • If a [<Path Tag>] group is not defined for a path listed under the [Wrap] group, that path will receive the default values for all of the [<Path Tag>] elements.
  • Explanation [<Path Tag>]
  • Take the descriptive tag under the initial [Wrap] group and write it here as a group name within the brackets [ ]
      • Baseline Adjust=
      • (See the Baseline Adjust element description)
      • Bottom Margin=
      • (See the Bottom Margin element description)
      • Clobber Path=
      • (See the Clobber Path element description)
      • Draw Path=
      • (See the Draw Path element description)
      • Enforce Paragraph Spacing=
      • (See the Enforce Paragraph Spacing element description)
      • Fill Rule=
      • (See the Fill Rule element description)
      • Fit Last Line=
      • (See the Fit Last Line element description)
      • Justify=
      • (See the Justify element description)
      • Left Margin=
      • (See the Left Margin element description)
      • Margins=
      • (See the Margins element description)
      • MinParagraph Lines=
      • (See the MinParagraph Lines element description)
      • Number Of Paths=
      • (See the Number Of Paths element description)
      • Overflow=
      • (See the Overflow element description)
      • Paragraph Adjust=
      • (See the Paragraph Adjust element description)
      • Paragraph Indent=
      • (See the Paragraph Indent element description)
      • Reverse Flow=
      • (See the Reverse Flow element description)
      • Reverse Path=
      • (See the Reverse Path element description)
      • Right Margin=
      • (See the Right Margin element description)
      • Top Margin=
      • (See the Top Margin element description)
  • Examples
    [Circle]
    ill Rule = EvenOddRule
    rawPath = False
    Overflow = Square
    [Square]
    FillRule = WindingRule
    DrawPath = True
    Overflow = Triangle
    [Triangle]
    FillRule = EvenOddRule
    DrawPath = False
    Overflow = Square
    [Square]
    FillRule = WindingRule
    DrawPath = True
    Overflow = Triangle
    [Triangle]
    FillRule = EvenOddRule
    DrawPath = False
  • Parameter Baseline Adjust
  • An element that determines the adjustments made to each baseline of text drawn within the path.
    Syntax Baseline Adjust = <BaseAdjustNum><Unit Type>
    See Also Paragraph Adjust, Enforce Paragraph Spacing.
    Remarks Optional.
  • By default, the process will space successive text lines at 120% of the font size. For example, a 12-point font will have the next baseline set at 14.4 points (120%×12) from the previous baseline.
  • The Baseline Adjust element defines an offset from this default value.
  • A positive Baseline Adjust value increases the space between each baseline of text (essentially, moving the next line of text down). A negative value decreases the space between each baseline of text (essentially, moving the next line of text up).
  • The default value for Baseline Adjust is 0.
  • Explanation <BaseAdjustNum>
      • Enter the number of units.
      • <Unit Type>
  • Optional. Enter the abbreviation to identify the unit type if the unit type for Baseline Adjust is different from the default unit type defined in the Units element. Possible values are:
    cm for centimeters
    dots for dots
    ft for feet
    in for inch (default value)
    mm for millimeter
    pts for points
  • Example BaselineAdjust=1 pt
  • Parameter=Bottom Margin
  • An element that specifies the distance from the bottom of the path at which to stop flowing text.
    Syntax BottomMargin = <Bottom Margin Num><Unit Type>
    See Also Margins, Overflow.
    Remarks Options.
  • NOTE: A non-zero value for the BottomMargin element overrides (for the bottom margin only) the value set in the Margins elements.
  • For example, if Margins=1 in and BottomMargin=2 in, the path will have 0.1-inch margins on the top, left, and right sides but will have a 2-inch margin on the bottom side.
  • The default value for Bottom Margin is 0.
  • Explanation <BottomMarginNum>
      • Enter the number of units.
      • <UnitType>
  • Optional. Enter the abbreviation to identify the unit type if the unit type for Bottom Margin is different from the default unit type defined in the Units element. Possible values are:
    cm for centimeters
    dots for dots
    ft for feet
    in for inch (default value)
    mm for millimeter
    pts for points
  • Example BottomMargin=3 mm
  • PARAMETER=Clobber Path
  • An element that specifies if two adjacent ON areas separated by a path segment are treated as one area when determining text flow.
    Syntax ClobberPath = [True/False]
    See Also FillRule
    Remarks Optional
  • This element affects the way in which text is flowed in adjacent ON areas. It applies only to paths defined with FillRule=WindingRule.
  • If ClobberPath is set to True, text is flowed across the two adjacent ON areas as if they were one area. In this case, only the “outer” margins of the combined areas would be recognized. Text flow would be continuous across the “inner” margins where the path segment intersects the adjacent areas.
  • If ClobberPath is set to False, text is flowed separately into each Area.
  • The default value of ClobberPath is True.
  • False.
  • Explanation (True/False)
      • If two adjacent ON areas are to be treated as one area, type True.
      • If two adjacent ON areas are to be maintained separately, type False.
  • Example ClobberPath=False
  • Parameter=DrawPath
  • An element that determines if the wrap path is actually drawn on the template.
    Syntax DrawPath = {True/False
    Remarks Optional.
    The default value for DrawPath is True.
      • If the wrap path is to be drawn on the template, type True.
      • If the wrap path is NOT to be drawn on the template, type False.
  • Example DrawPath=False
  • Parameter=EnforceParagraphSpacing
  • An element that determines if the next paragraph will always start at a distance of the ParagraphAdjust value from any previous paragraphs that were set.
    Syntax EnforceParagraphSpacing = {True/False}
    See Also BaselineAdjust, ParagraphAdjust.,
    Remarks Optional.
  • If the text flowed into your path contains blank paragraphs, this element determines how the blank paragraphs are to be handled.
  • If you want your next paragraph to start at a distance of the ParagraphAdjust value from your previous text paragraph (thereby, “skipping” any blank paragraphs and permitting text to continue to flow), set the EnforceParagraphSpacing value to True.
  • If you want the blank paragraphs to be allotted the appropriate space defined in ParagraphAdjust, set the EnforceParagraphSpacing value to False.
  • The default value for EnforceParagraphSpacing is False.
  • Explanation {True/False}
  • If the next non-blank paragraph should start at a distance of the ParagraphAdjust value from any previous paragraphs that were set, type True
  • If blank paragraphs are to be allocated their appropriate paragraph space, type False.
  • Example EnforceParagraphSpacing=True
  • Parameter=FillRule
  • An element that provides the rules used to determine which areas of the path should have text flowed into them and which areas should be blank.
    Syntax FillRule = {WindingRule/EvenOddRule)
    See Also ClobberPath, ReversePath.
    Remarks Optional.
  • Text is flowed into an area enclosed by (“inside”) the current path. If a path is simple, it is clear which areas are inside the path. However, if a path is complex (for example, intersecting itself or having one subpath that encloses another), it is not as apparent which areas are inside. One of two fill rules will be used to determine which areas lie inside a path.
  • The FillRule element defines if the non-zero winding rule (WindingRule) or the even-odd rule (EvenOddRule) will be used for the current path.
  • The non-zero winding rule determines whether a given area along the proposed flow line is inside the path (and thus receives text) by examining the places where a path segment crosses the flow line. Path segments that cross (intersect) the flow line from top to bottom are given a direction of 1. Path segments that cross (intersect) the flow line from bottom to top are given a direction of −1. Path segments that do not fully cross the flow line (for example, entering and exiting the top of the flow line) are given a direction of zero.
  • An on-going sum of all crossings is calculated from left to right. If the sum of all crossings to that point is zero, the area (immediately to the right) is outside the path. If the sum is non-zero, the area is inside the path and will receive text.
  • The even-odd rule determines whether a given area long the proposed flow line is inside the path (and thus receives text) by counting the number of times a path segment crosses the flow line. Path segments that fully cross (intersect) the flow line are given a score of 1. Path segments that do not fully cross the flow line are given a score of zero.
  • An on-going sum of all crossings is calculated from left to right. If the sum of all crossings to that point is even, the area (immediately to the right) is outside the path. If the sum is odd, the area is inside the path and will receive text.
  • The default value for FillRule is WindingRule.
  • Explanation {Winding Rule/EvenOddRule}
  • If the winding rule will determine which areas lie inside a path, type WindingRule.
  • If the even-odd rule will determine which areas lie inside a path, type EvenOddRule.
  • Example FillRule=EvenOddRule
  • Parameter=FitLastLine
  • An element that determines if the Fit justification rule is applied to the last line of every paragraph.
    Syntax itLastLine = {True/False},
    See Also Justify
    Remarks Optional.
  • The FitLastLine element applies only to paths defined with Justify=Fit.
  • If FitLastLine is set to True, the text on the last line will be forced to fit flush on the left and the right. Since the last line of a paragraph may often contain less text than the other lines in a paragraph, this justification will often result in more white space between text on the last line.
  • The default value for FitLastLine is False.
  • Explanation (True/False)
  • If the last line of every paragraph should be aligned at both the left side and the right side of the path, type True.
  • If the last line of every paragraph should not be forced to fit flush left and flush right, type False.
  • Example FitLastLine=False
  • Parameter=Justify
  • An element that specifies the type of justification (horizontal alignment) to be applied to each line of text drawn in the path.
    Syntax Justify = <JustifyRule>
    See Also FitLastLine
    Remarks Optional
    The default value for Justify is Left.
  • Explanation <JustifyRule>
  • Enter the type of justification (horizontal alignment) to be applied to each line of text drawn in the path. Possible values are:
      • Left (Default value) Text is aligned from the left side of the path.
      • Right Text is aligned from from the right side of the path.
      • Center Text is centered between the left side and right side of the path.
      • Fit Text is aligned at both the left side and right side of the path.
  • Example Justify=Center
  • Parameter=LeftMargin
  • An element that specifies the distance from the left side of the path at which to start flowing text.
    Syntax LeftMargin = <LeftMarginNum><UnitType>
    See Also Margins
    Remarks Optional
  • NOTE: A non-zero value for the LeftMargin element overrides (for the left margin only) the value set in the Margins elements.
  • For example, if Margins=1 in and LeftMargin=2 in, the path will have 1-inch margins on the bottom, top, and right sides but will have a 2-inch margin on the left side.
  • A default value for LeftMargin is 0.
  • Explanation <LeftMarginNum>
      • Enter the number of units.
      • <UnitType>
  • Optional. Enter the abbreviation to identify the unit type if the unit type for LeftMargin is different from the default unit type defined in the Units element. Possible values are:
    cm for centimeters
    dots for dots
    ft for feet
    in for inch (default value)
    mm for millimeters
    pts for points
  • Example LeftMargin=5 mm
  • Parameter=Margins
  • An element that specifies the same text margins for all four sides of the path (top, bottom, left, and right).
    Syntax Margins = <MarginsNum><Unit Type>
    See Also BottomMargin, LeftMargin, RightMargin, TopMargin
    Remarks Optional.
  • Note: The value for the Margins element will be overridden on an individual margin basis by any non-zero value defined for the other specific margin attributes (BottomMar LeftMargin, RightMargin, and TopMargin).
  • For example, if Margins=1 in and TopMargin=2 in, the path will have 1-inch margins on the bottom, left, and right sides but will have a 2-inch margin on the top.
  • The default value for Margins is 0.
  • Explanation <MarginsNum>
      • Enter the number of units.
      • <UnitType>
  • Optional. Enter the abbreviation to identify the unit type if the unit type for Margins is different from the default unit type defined in the Units e˜element. Possible values are:
    cm for centimeters
    dots for dots
    ft for feet
    in for inch (default value)
    mm for millimeter
    pts for points
  • Example Margins=6 mm
  • Parameter=MinParagraphLines
  • An element that specifies the minimum number of lines of a paragraph to be set before the paragraph is allowed to be split between path areas.
    Syntax MinParagraphLines = <MinLinesNum>
    See Also NumberOfPaths, Overflow.
    Remarks Optional.
  • If the minimum number of lines of a paragraph defined here cannot be set consecutively in a path area, the entire paragraph will be moved down to the next scanline that allows the specified number of lines to be set consecutively.
  • The default value for MinParagraphLines is 1.
  • Explanation <MinLinesNum>
  • Enter the integer representing the minimum number of lines of a paragraph to beset before splitting between path areas is permitted.
  • Example Min Paragraph Lines=2
  • Parameter=NumberOfPaths
  • An element that determines how many postscript paths on the template are concatenated and treated as one path.
    Syntax NumberOfPaths = <PathsNum>
    See Also MinParagraphLines, Overflow.
    Remarks Optional.
  • This element is used to combine multiple paths drawn on the template, and to.treat them as a single path. The path to be combined will be determined—by the order in which they were drawn.
  • The default value for NumberOfPaths is 1.
  • Explanation <PathsNum>
  • Enter the integer representing the number of paths to be combined.
  • Example NumberOfPaths=2
  • Illustration See FIG. 12 and corresponding description above.
  • Parameter=Overflow
  • An element that specifies the name (tag) of the wrap path that will receive overflow text from the current wrap path being described.
    Syntax Overflow = <PathTag>
    See Also MinParagraph Lines, NunberOfPaths.
    Remarks Optional.
  • This element defines the use of an overflow feature. When overflow is available, if the current path has no more space into which text can flow, the text will continue to flow into the path named in this element.
  • NOTE: If the Overflow element references a wrap path that is not named under the [Wrap] group, the print job will be aborted.
  • If the Overflow element is not defined, the system will assume that no overflow will occur for the current path being described. Therefore, text will flow into the current path until it is filled. No overflow text will be printed.
  • Explanation <PathTag>
  • Enter the descriptive tag of the path into which overflow text from the current path will flow. This value should correspond to a descriptive tag that you created under the initial (Wrap] group.
  • Example Overflow=Square
  • Illustration See FIG. 13 and the corresponding description above.
  • Parameter=ParagraphAdjust
  • An element that determines the distance to adjust the baseline for the start of the next paragraph within the path.
    Syntax ParagraphAdjust = <ParagraphadjustNum><Unit Type>
    See Also BaselineAdjust, Enforce Paragraph Spacing
    Remarks Optional.
  • The ParagraphAdjust value overrides the Baseline Adjust value only for the first baseline of text in each paragraph.
  • A position ParagraphAdjust value increases the vertical space between the last baseline of text in each paragraph and the start of the next paragraph (essentially, moving the start of the next paragraph down). A negative value decreases the vertical space between the last baseline of text in each paragraph and the start of the next paragraph (essentially, moving the start of the next paragraph up).
  • The default value for ParagraphAdjust is 0.
  • Explanation <ParagraphadjustNum>
      • Enter the number of units.
      • <Unit Type>
  • Optional. Enter the abbreviation to identify the unit type if the unit type for ParagraphAdjust is different from the default unit type defined in the Units element. Possible values are:
    cm for centimeters
    dots for dots
    ft for feet
    in for inch (default value)
    mm for millimeter
    pts for points
  • Example ParagraphAdjust=6 pts
  • Parameter=ParagraphIndent
  • An element that specifies the indentation from the left margin for the first line of every paragraph in the path.
    Syntax ParagraphIndent = <ParagraphIndentNum><UnitType>
    See Also ParagraphAdjust
    Remarks Optional.
    The default value for ParagraphIndent is 0.
  • Explanation <ParagraphIndentNum>
      • Enter the number of units.
      • <UnitType>
  • Optional. Enter the abbreviation to identify the unit type if the unit type for ParagraphIndent is different from the default unit type defined in the Units element. Possible values are:
    cm for centimeters
    dots for dots
    ft for feet
    in for inch (default value)
    mm for millimeter
    pts for points
  • Example ParagraphIndent 0.5 in
  • Parameter=ReverseFlow
  • An element that determines if the text will be flowed from bottom to top in the current path.
    Syntax ReverseFlow = (True/False
    See Also FillRule
    Remarks Optional.
  • The default value for ReverseFlow is False.
  • Explanation {True/False}
      • If the text will be flowed from bottom to top, type True.
      • If the text will be flowed from top to bottom, type False.
  • Example ReverseFlow=True
  • Parameter=ReversePath
  • An element that determines if the ON/OFF designations for areas in the path will be reversed.
    Syntax ReversePath = {True/False}
    See Also Fill Rule
    Remarks Optional.
  • The ReversePath element applies only to paths defined with FillRule=EvenOddRule.
  • If ReversePath is set for True, the areas originally marked as ON based on the EvenOddRule calculation will be set to OFF and the areas originally marked as OFF based on the EvenOddRule calculation will be set to ON.
  • If ReversePath is set to False, the EvenOddRule calculations will be retained.
  • The default value for ReversePath is False.
  • Explanation (True/False)
  • If the ON/OFF designations for areas in the path will be reversed, type True.
  • If the ON/OFF designations for areas in the path will be retained, type False.
  • Example ReversePath=True
  • Parameter=RightMargin
  • An element that specifies the distance from the side of the path at which to stop flowing test.
    Syntax RightMargin = <RightMarginNum><UnitType>
    See Also Margins
    Remarks Optional.
  • NOTE: A non-zero value for the RightMargin element overrides (for the right margin only) the value set in the Margins element.
  • For example, if Margins=1 in and RightMargin=2 in, the path will have 1-inch margins on the bottom, top, and left sides but will have a 2-inch margin on the right side.
  • The default value for RightMargin is 0.
  • Explanation <RightMarginNum>
      • Enter the number of units.
      • <Unit Type>
  • Optional. Enter the abbreviation to identify the unit type if the unit type for RightMargin is different from the default unit type defined in the Units element. Possible values are:
    cm for centimeters
    dots for dots
    ft for feet
    in for inch (default value)
    mm for millimeter
    pts for points
  • Example RightMargin 5 mm
  • Parameter=TopMargin
  • An element that specifies the distance from the top of the path at which to start flowing text.
    Syntax TopMargin = <TopMarginNum><UnitType>
    See Also Margins
    Remarks Optional.
  • NOTE: A non-zero value for the TopMargin element overrides (for the top margin only) the value set in the Margins element.
  • For example, if Margins=1 in and TopMargin=2 in, the path will have 1-inch margins on the bottom, left, and right sides but will have a 2-inch margin on the top side.
  • The default value for TopMargin is 0.
  • Explanation <TopMarginNum>
      • Enter the number of units.
      • <Unit Type>
  • Optional. Enter the abbreviation to identify the unit type if the unit type for TopMargin is different from the default unit type defined in the Units element. Possible values are:
    cm for centimeters
    dots for dots
    ft for feet
    in for inch (default value)
    mm for millimeter
    pts for points
  • Example TopMargin=0.25 in

Claims (13)

1. A method for wrapping data to an arbitrary path defined by a page description language, comprising the steps of:
(a) processing a page description language specification defining a static data area and at least one data wrapping boundary to generate a printable image representation of at least the static data area;
(b) associating a data block external to the page description language specification with the data wrapping boundary; and
(c) generating and flowing printable image representations of the data block according to the data wrapping boundary.
2. The method of claim 1, further including the step of:
(d) merging the printable image representation of the data block with the printable image representation of the static data area.
3. The method of claim 1, wherein steps (b) through (d) are repeated for multiple external data blocks.
4. The method of claim 2, wherein the method further includes the step of caching the printable image representation of at least the static data area and step (d) includes a step of retrieving a copy of the printable image representation from the cache and merging the printable image representation of the data block with the copy of the printable image representation of the static data area.
5. The method of claim 1, further comprising the step of:
associating a graphics state with the data wrapping boundary;
wherein step (c) includes the step of applying the graphics state to the data block during the generation of the printable image representation of the data block.
6. The method of claim 5, wherein the graphics state is defined in the page description language specification.
7. The method of claim 5, wherein the graphics state is defined in a file external to the page description language specification.
8. A computer-implemented method for generating a document, comprising the steps of:
(a) accessing a data area defined in a template document representation;
(b) monitoring a text string defined in the data area for a first special character or first string of characters, the first character or first string of characters being indicative of a wrapping command;
(c) responsive to a detection of the special character or string of characters in the text string, identifying a boundary within the template document representation and having a predetermined relationship with the data area as being a data wrapping boundary;
(d) associating a block of data external to the template document representation with the data wrapping boundary; and
(e) generating a bitmap representation of the block of data according to the data wrapping boundary and according to a flow rule.
9. The method of claim 8, further comprising the step of:
associating a graphics state with the data wrapping boundary, wherein the generating step (e) includes a step of applying the graphic state to the block of data.
10. The method of claim 9, wherein
the graphics state includes at least one printable attribute that controls the printable image representation of the data block.
11. A method for wrapping data to an arbitrary path defined by a page description language, comprising the steps of:
(a) accessing a data area defined in a page description language specification, the specification further defining a graphics state corresponding to the data area, the graphics state including at least one print attribute which controls the appearance of data in the data area;
(b) monitoring a text string defined in the data area for a first special character or first string of characters, the first character or first string of characters being indicative of a wrapping command;
(c) responsive to a detection of the special character or string of characters in the text string, (i) identifying a path defined by the page description language specification and having a predetermined relationship with the data area as being associated with the wrapping command, the path having a boundary, and (ii) storing the graphics state corresponding to the data area in memory;
(d) associating a block of text with the wrapping command;
(e) applying the stored graphics state to the block of text to generate bitmap representations of the block of text; and
(f) arranging the bitmap representations of the block of text, according to the boundary and according to a predefined flow rule.
12. A computer-implemented method for wrapping text to a path defined in a print specification, comprising the steps of:
(a) accessing a data area defined in a print specification;
(b) monitoring a text string defined in the data area for a first special character or first string of characters, the first character or first string of characters being indicative of a wrapping command;
(c) responsive to a detection of the special character or string of characters in the text string, identifying a path defined by the print specification and having a predetermined relationship with the data area as being a text-wrapping path associated with the wrapping command;
(d) associating a block of text with the text-wrapping path; and
(e) generating a bitmap representation of the block of text according to a pre-defined flow rule to be imposed on the text-wrapping path.
13. A computer-implemented method for wrapping text to a path defined in a page description language, comprising the steps of:
(a) accessing a data area defined in a page description language specification;
(b) monitoring a text string defined in the data area for a first special character or first string of characters, the first character or first string of characters being indicative of a wrapping command;
(c) responsive to a detection of the special character or string of characters in the text string, identifying a path defined by the print specification and having a predetermined relationship with the data area as being a text boundary associated with the wrapping command;
(d) associating a coordinate system with the text boundary;
(e) associating a block of text with the text boundary; and
(f) generating a bitmap representation of the block of text according to the coordinate system and according to a flow rule.
US11/153,256 1997-07-18 2005-06-15 Method and system for flowing data to an arbitrary path defined by a page description language Abandoned US20050286065A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US11/153,256 US20050286065A1 (en) 1997-07-18 2005-06-15 Method and system for flowing data to an arbitrary path defined by a page description language

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US08/897,467 US6209010B1 (en) 1997-07-18 1997-07-18 Computer implemented method for wrapping data to an arbitrary path defined by a page description language
US09/818,665 US6487568B1 (en) 1997-07-18 2001-03-27 Method and system for flowing data to an arbitrary path defined by a page description language
US10/629,338 US20050076001A1 (en) 1997-07-18 2003-07-29 Method and system for flowing data to an arbitrary path defined by a page description language
US11/153,256 US20050286065A1 (en) 1997-07-18 2005-06-15 Method and system for flowing data to an arbitrary path defined by a page description language

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10/629,338 Continuation US20050076001A1 (en) 1997-07-18 2003-07-29 Method and system for flowing data to an arbitrary path defined by a page description language

Publications (1)

Publication Number Publication Date
US20050286065A1 true US20050286065A1 (en) 2005-12-29

Family

ID=27124291

Family Applications (4)

Application Number Title Priority Date Filing Date
US09/818,665 Expired - Lifetime US6487568B1 (en) 1997-07-18 2001-03-27 Method and system for flowing data to an arbitrary path defined by a page description language
US10/233,263 Expired - Lifetime US6599325B2 (en) 1997-07-18 2002-08-30 Method and system for flowing data to an arbitrary path defined by a page description language
US10/629,338 Abandoned US20050076001A1 (en) 1997-07-18 2003-07-29 Method and system for flowing data to an arbitrary path defined by a page description language
US11/153,256 Abandoned US20050286065A1 (en) 1997-07-18 2005-06-15 Method and system for flowing data to an arbitrary path defined by a page description language

Family Applications Before (3)

Application Number Title Priority Date Filing Date
US09/818,665 Expired - Lifetime US6487568B1 (en) 1997-07-18 2001-03-27 Method and system for flowing data to an arbitrary path defined by a page description language
US10/233,263 Expired - Lifetime US6599325B2 (en) 1997-07-18 2002-08-30 Method and system for flowing data to an arbitrary path defined by a page description language
US10/629,338 Abandoned US20050076001A1 (en) 1997-07-18 2003-07-29 Method and system for flowing data to an arbitrary path defined by a page description language

Country Status (1)

Country Link
US (4) US6487568B1 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070195095A1 (en) * 2006-02-17 2007-08-23 Microsoft Corporation Applying effects to a merged text path
US20080028299A1 (en) * 2006-07-31 2008-01-31 Microsoft Corporation Wrapping nodes in a drawing canvas
US20100275156A1 (en) * 2006-07-31 2010-10-28 Microsoft Corporation Managing Data Across a Semantic Data View and a Presentation Data View
US20150039992A1 (en) * 2013-07-31 2015-02-05 Google Inc. Mechanism for setting ascent and baseline for html elements
US20160041802A1 (en) * 2013-04-10 2016-02-11 Hewlett-Packard Indigo, B.V. Data transfer system, method of transferring data, and system

Families Citing this family (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6243172B1 (en) * 1995-01-18 2001-06-05 Varis Corporation Method and system for merging variable text and images into bitmaps defined by a page description language
US5729665A (en) * 1995-01-18 1998-03-17 Varis Corporation Method of utilizing variable data fields with a page description language
US6952801B2 (en) * 1995-06-07 2005-10-04 R.R. Donnelley Book assembly process and apparatus for variable imaging system
US6487568B1 (en) * 1997-07-18 2002-11-26 Tesseron, Ltd. Method and system for flowing data to an arbitrary path defined by a page description language
JP3226095B2 (en) * 1998-10-14 2001-11-05 セイコーエプソン株式会社 Network printer
US7278094B1 (en) 2000-05-03 2007-10-02 R. R. Donnelley & Sons Co. Variable text processing for an electronic press
WO2001058075A2 (en) * 2000-02-03 2001-08-09 Xmpie Inc. System and method for production of dynamic documents utilizing a page description language
US20020049702A1 (en) * 2000-02-03 2002-04-25 Jacob Aizikowitz System and method for creating customized documents for cross media publishing
WO2004021101A2 (en) * 2002-08-28 2004-03-11 Xmpie (Israel) Ltd. Apparatus and method for processing variable print documents
US8064090B2 (en) * 2002-08-28 2011-11-22 Xmpie (Israel) Ltd. System and method for processing variable print documents
AU2003901723A0 (en) * 2003-04-11 2003-05-01 Ronald Wayne Anderson System for printing variable data
GB2421106A (en) * 2004-12-07 2006-06-14 Hewlett Packard Development Co A method and apparatus for preparing variable-data documents for publishing
JP4756870B2 (en) * 2005-02-03 2011-08-24 キヤノン株式会社 Document processing apparatus, document processing method, and program
US20080016061A1 (en) * 2006-07-14 2008-01-17 Bea Systems, Inc. Using a Core Data Structure to Calculate Document Ranks
US7873641B2 (en) * 2006-07-14 2011-01-18 Bea Systems, Inc. Using tags in an enterprise search system
JP4892429B2 (en) * 2007-07-26 2012-03-07 キヤノン株式会社 Image forming apparatus, image forming apparatus control method and program
JP5252933B2 (en) * 2008-01-24 2013-07-31 キヤノン株式会社 Document processing apparatus, document processing method, and program
US8355167B2 (en) * 2009-02-25 2013-01-15 Xerox Corporation Method and apparatus for using pattern color space in print job processing
US11803918B2 (en) 2015-07-07 2023-10-31 Oracle International Corporation System and method for identifying experts on arbitrary topics in an enterprise social network
US10248364B2 (en) * 2017-06-23 2019-04-02 Xerox Corporation Method and system for print device problem capture

Citations (94)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3576367A (en) * 1968-09-06 1971-04-27 Ibm Machine for preparing documents
US4085445A (en) * 1976-06-07 1978-04-18 International Business Machines Corporation Text merge with copies and envelopes
US4250976A (en) * 1978-05-22 1981-02-17 Nissan Motor Company, Limited Steering lock device with safety system
US4314357A (en) * 1978-12-27 1982-02-02 Fuji Photo Film Co., Ltd. Form combining and recording device
US4322157A (en) * 1979-09-03 1982-03-30 Ricoh Co., Ltd. Copying machine
US4441829A (en) * 1981-09-24 1984-04-10 International Business Machines Method for performing a multiple page get operation in a text processing system
US4493049A (en) * 1981-06-05 1985-01-08 Xerox Corporation Shared resource clustered printing system
US4509826A (en) * 1983-04-11 1985-04-09 Xerox Corporation Optical image staggering/destaggering arrangement for multiple array scanning system
US4651278A (en) * 1985-02-11 1987-03-17 International Business Machines Corporation Interface process for an all points addressable printer
US4718784A (en) * 1986-11-10 1988-01-12 Electronic Programming Corporation Rating plate printing apparatus and method
US4723210A (en) * 1984-08-30 1988-02-02 International Business Machines Corp. Superblock structure in a multiple in a data editor
US4723209A (en) * 1984-08-30 1988-02-02 International Business Machines Corp. Flow attribute for text objects
US4723211A (en) * 1984-08-30 1988-02-02 International Business Machines Corp. Editing of a superblock data structure
US4739477A (en) * 1984-08-30 1988-04-19 International Business Machines Corp. Implicit creation of a superblock data structure
US4809220A (en) * 1984-03-30 1989-02-28 Wang Laboratories, Inc. Electronic processing system using printer and microprocessor to create forms template with pre-printed forms
US4825251A (en) * 1987-05-19 1989-04-25 The Mead Corporation Imaging process involving hardening of imaging web border area photosensitive microcapsules and an apparatus useful therein
US4903229A (en) * 1987-03-13 1990-02-20 Pitney Bowes Inc. Forms generating and information retrieval system
US4903067A (en) * 1987-04-28 1990-02-20 Canon Kabushiki Kaisha Multiimage forming apparatus
US4912491A (en) * 1987-05-30 1990-03-27 Canon Kabushiki Kaisha Apparatus for forming superimposed images
US4992956A (en) * 1987-10-08 1991-02-12 Advanced Micro Devices, Inc. Apparatus for assembling data for supply to a scanning output device
US4994968A (en) * 1989-03-30 1991-02-19 Brother Kogyo Kabushiki Kaisha Word processing device
US4996662A (en) * 1983-10-03 1991-02-26 Wang Laboratories, Inc. Method for generating document using tables storing pointers and indexes
US5001653A (en) * 1989-09-08 1991-03-19 International Business Machines Corporation Merging plotter graphics within a text environment on a page printer
US5078748A (en) * 1990-02-09 1992-01-07 Hans Schwarzkopf Gmbh Substituted 1,3-diaminobenzenes, processes for their preparation and coloring agents, containing these, for keratin fibers
US5084831A (en) * 1990-05-01 1992-01-28 Minolta Camera Kabushiki Kaisha Printer and printing method
US5103490A (en) * 1990-06-13 1992-04-07 National Computer Systems, Inc. Method and apparatus for storing and merging multiple optically scanned images
US5104245A (en) * 1989-01-13 1992-04-14 Casio Computer Co., Ltd. Printing apparatus with form editor
US5107423A (en) * 1988-03-26 1992-04-21 Brother Kogyo Kabushiki Kaisha Document processing device with merge function
US5181162A (en) * 1989-12-06 1993-01-19 Eastman Kodak Company Document management and production system
US5191429A (en) * 1990-09-28 1993-03-02 Xerox Corporation Electronic printing system for printing multiple images with determination of the maximum number of reduced size images to be optimally printed on a sheet of detected size without interference
US5202206A (en) * 1991-10-04 1993-04-13 Xerox Corporation Process for simultaneous printing of fixed data and variable data
US5204916A (en) * 1991-08-06 1993-04-20 Eastman Kodak Company Tile-oriented technique for collectively performing image rotation, scaling and digital halftone screening
US5204946A (en) * 1988-06-17 1993-04-20 Canon Kabushiki Kaisha Mixed text and image data processing
US5206951A (en) * 1987-08-21 1993-04-27 Wang Laboratories, Inc. Integration of data between typed objects by mutual, direct invocation between object managers corresponding to object types
US5276799A (en) * 1991-10-29 1994-01-04 Xerox Corporation Expandable electronic subsystem for a printing machine
US5280574A (en) * 1989-05-26 1994-01-18 Hitachi, Ltd. Text document management method adapted for generating plural text documents derived from the same original text document
US5282269A (en) * 1985-09-27 1994-01-25 Oce-Nederland B.V. Raster image memory
US5287128A (en) * 1992-08-28 1994-02-15 Moore Business Forms, Inc. Method to manufacture multiple part imaged documents
US5287444A (en) * 1989-08-14 1994-02-15 International Business Machines Corporation Message processing system
US5291243A (en) * 1993-02-05 1994-03-01 Xerox Corporation System for electronically printing plural-color tamper-resistant documents
US5290109A (en) * 1986-12-26 1994-03-01 Seiko Epson Corporation Electronic typewriter for printing of documents having a fixed format
US5303341A (en) * 1991-10-29 1994-04-12 Xerox Corporation Video processor for a printing apparatus
US5307266A (en) * 1990-08-22 1994-04-26 Hitachi, Ltd. Information processing system and method for processing document by using structured keywords
US5307458A (en) * 1991-12-23 1994-04-26 Xerox Corporation Input/output coprocessor for printing machine
US5379368A (en) * 1990-11-30 1995-01-03 Hitachi, Ltd. Printing control method and apparatus
US5379373A (en) * 1990-06-15 1995-01-03 Fuji Xerox Co., Ltd. Document layout processing method and device for carrying out the same
US5384886A (en) * 1991-04-01 1995-01-24 Xerox Corporation Process for electronically printing envelopes
US5384901A (en) * 1992-10-22 1995-01-24 Xerox Corporation Method of rendering a color image for an output medium from symbolic image data
US5404294A (en) * 1990-02-26 1995-04-04 Karnik; Jayant D. Tag method for moving information between computers & forms
US5483629A (en) * 1992-04-30 1996-01-09 Ricoh Company, Ltd. Method and system to handle dictionaries in a document processing language
US5483623A (en) * 1991-10-24 1996-01-09 Canon Kabushiki Kaisha Printing apparatus
US5483624A (en) * 1992-03-27 1996-01-09 Monarch Marking Systems, Inc. Programmable hand held labeler
US5487165A (en) * 1992-04-30 1996-01-23 Ricoh Company, Ltd. Standard page description language cleartext structure generator
US5490243A (en) * 1990-12-13 1996-02-06 F3 Software Corporation Data processing system for multi-platform print control and electronic data fill
US5493634A (en) * 1992-06-12 1996-02-20 Xerox Corporation Apparatus and method for multi-stage/multi-process decomposing
US5495565A (en) * 1994-06-21 1996-02-27 Wang Laboratories, Inc. Integrated form document editor with form descriptor table, background bitmap, graphics editor and text editor, composite image generator and intelligent autofill
US5499329A (en) * 1992-04-30 1996-03-12 Ricoh Company, Ltd. Method and system to handle context of interpretation in a document processing language
US5500928A (en) * 1993-03-01 1996-03-19 Xionics Document Technologies, Inc. Digital printing system and process using adaptive compression
US5502796A (en) * 1991-07-20 1996-03-26 Brother Kogyo Kabushiki Kaisha Print device capable of printing a format sheet in which items about a print device and a document processor are completed
US5504891A (en) * 1991-10-17 1996-04-02 Ricoh Company, Ltd. Method and apparatus for format conversion of a hierarchically structured page description language document
US5504843A (en) * 1993-01-04 1996-04-02 Xerox Corporation Apparatus and method for processing a stream of image data in a printing system
US5506697A (en) * 1990-01-05 1996-04-09 Symbol Technologies, Inc. Apparatus for processing human-readable and machine-readable documents
US5506985A (en) * 1991-10-17 1996-04-09 Ricoh Company, Ltd. Method and apparatus for format conversion of a hierarchically structured page description language document
US5592683A (en) * 1994-03-18 1997-01-07 Ibm Corporation System for selectively processing nested print commands and buffered post-print commands thereafter and resending selected portion of data stream upon error detection
US5594860A (en) * 1995-01-27 1997-01-14 Varis Corporation Method for banding and rasterizing an image in a multiprocessor printing system
US5600768A (en) * 1995-06-06 1997-02-04 Apple Computer, Inc. Image generation with dynamically consolidated list of image data
US5611024A (en) * 1992-08-28 1997-03-11 Compaq Computer Corporation Data compression of bit map images
US5611035A (en) * 1992-10-16 1997-03-11 International Business Machines Corporation Relational data base system for conveniently constructing graphical images
US5621020A (en) * 1996-06-19 1997-04-15 Moore Business Forms, Inc. Release composition for printable linerless labels
US5706365A (en) * 1995-04-10 1998-01-06 Rebus Technology, Inc. System and method for portable document indexing using n-gram word decomposition
US5717840A (en) * 1992-07-08 1998-02-10 Canon Kabushiki Kaisha Method and apparatus for printing according to a graphic language
US5727220A (en) * 1995-11-29 1998-03-10 International Business Machines Corporation Method and system for caching and referencing cached document pages utilizing a presentation data stream
US5729665A (en) * 1995-01-18 1998-03-17 Varis Corporation Method of utilizing variable data fields with a page description language
US5729674A (en) * 1995-04-07 1998-03-17 Computer Humor Systems, Inc. Method and apparatus for producing personalized graphics and personalized text printed materials
US5734915A (en) * 1992-11-25 1998-03-31 Eastman Kodak Company Method and apparatus for composing digital medical imagery
US5740338A (en) * 1995-11-13 1998-04-14 Varis Corporation Method for merging variable image data into a template image
US5745910A (en) * 1993-05-10 1998-04-28 Apple Computer, Inc. Frame structure which provides an interface between parts of a compound document
US5866286A (en) * 1993-04-16 1999-02-02 Moore Business Forms, Inc. Color selection by mixing primary toners
US5877865A (en) * 1993-10-26 1999-03-02 Canon Kabushiki Kaisha Image processing apparatus and method for printing data described in a page description language
US5880742A (en) * 1993-09-17 1999-03-09 Xerox-Corporation Spreadsheet image showing data items as indirect graphical representations
US5895455A (en) * 1995-08-11 1999-04-20 Wachovia Corporation Document image display system and method
US5896462A (en) * 1994-10-04 1999-04-20 Stern; Yonatan Method for storing and retrieving images in/from a database
US6016380A (en) * 1992-09-24 2000-01-18 Avid Technology, Inc. Template-based edit decision list management system
US6018774A (en) * 1997-07-03 2000-01-25 Yobaby Productions, Llc Method and system for creating messages including image information
US6020894A (en) * 1990-08-16 2000-02-01 Canon Kabushiki Kaisha Full-color desktop publishing system
US6027195A (en) * 1996-11-12 2000-02-22 Varis Corporation System and method for synchronizing the piezoelectric clock sources of a plurality of ink jet printheads
US6049390A (en) * 1997-11-05 2000-04-11 Barco Graphics Nv Compressed merging of raster images for high speed digital printing
US6209010B1 (en) * 1997-07-18 2001-03-27 Varis Corporation Computer implemented method for wrapping data to an arbitrary path defined by a page description language
US6505980B1 (en) * 1999-02-12 2003-01-14 Silver Fox Limited System and method for printing sequences of indicia
US20030050934A1 (en) * 1997-07-18 2003-03-13 Gauthier Forrest P. Method and system for flowing data to an arbitrary path defined by a page description language
US6557017B1 (en) * 1998-02-06 2003-04-29 Xerox Corporation Image production system theme integration
US6684016B2 (en) * 2000-08-25 2004-01-27 Lg Cable Ltd. Optical fiber for wavelength division multiplexing optical transmission system using densely spaced optical channels
US6684188B1 (en) * 1996-02-02 2004-01-27 Geoffrey C Mitchell Method for production of medical records and other technical documents
US6707572B1 (en) * 1997-09-12 2004-03-16 Tesseron, Ltd. Filtering method to reduce pixel density

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5222236A (en) 1988-04-29 1993-06-22 Overdrive Systems, Inc. Multiple integrated document assembly data processing system
US5208906A (en) 1988-12-30 1993-05-04 Chipsoft Ca, Corp. Method and apparatus for representing bordered areas of a generic form with records
US5157765A (en) 1989-11-15 1992-10-20 International Business Machines Corporation Method and apparatus for pipelined parallel rasterization
US5459826A (en) * 1990-05-25 1995-10-17 Archibald; Delbert M. System and method for preparing text and pictorial materials for printing using predetermined coding and merging regimen
US5134669A (en) 1990-06-13 1992-07-28 National Computer Systems Image processing system for documentary data
US5509115A (en) * 1990-08-08 1996-04-16 Peerless Systems Corporation Method and apparatus for displaying a page with graphics information on a continuous synchronous raster output device
US5542052A (en) * 1991-03-04 1996-07-30 Adobe Systems Incorporated Applying traps to a printed page specified in a page description language format
US5231698A (en) 1991-03-20 1993-07-27 Forcier Mitchell D Script/binary-encoded-character processing method and system
US5467448A (en) 1991-05-10 1995-11-14 Claris Corporation Text formatting by the direct selection of borders in an editing display
US5544287A (en) 1993-06-03 1996-08-06 Monarch Marking Systems, Inc. On-line barcode printer system with multi-level user printer commands
US5530793A (en) * 1993-09-24 1996-06-25 Eastman Kodak Company System for custom imprinting a variety of articles with images obtained from a variety of different sources
US5539529A (en) * 1994-04-04 1996-07-23 Merchant; Zaffer S. Facsimile communication with selective call receivers
US5559933A (en) * 1994-04-22 1996-09-24 Unisys Corporation Distributed enterprise print controller
DE69401435T2 (en) 1994-09-13 1997-06-26 Agfa Gevaert Nv Changing data fields in a page description language
US5671345A (en) 1995-06-06 1997-09-23 Apple Computer, Inc. System and method for intercepting and reconstructing graphics management tool marking instructions
US5841420A (en) 1995-08-18 1998-11-24 International Business Machines Corporation Method and system in a data processing system windowing environment for displaying previously obscured information
US5926185A (en) 1996-05-03 1999-07-20 Barco Graphics N.V. Method for processing a set of page description language commands to reduce complexity
EP0814425A3 (en) 1996-06-18 1999-08-18 SCITEX DIGITAL PRINTING, Inc. Method for creating complex layouts with variable data for high speed printing systems
CA2215094A1 (en) 1996-10-16 1998-04-16 Brian F. Hern Method for creating complex layouts with variable data for multiple high speed printing systems

Patent Citations (99)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3576367A (en) * 1968-09-06 1971-04-27 Ibm Machine for preparing documents
US4085445A (en) * 1976-06-07 1978-04-18 International Business Machines Corporation Text merge with copies and envelopes
US4250976A (en) * 1978-05-22 1981-02-17 Nissan Motor Company, Limited Steering lock device with safety system
US4314357A (en) * 1978-12-27 1982-02-02 Fuji Photo Film Co., Ltd. Form combining and recording device
US4322157A (en) * 1979-09-03 1982-03-30 Ricoh Co., Ltd. Copying machine
US4493049A (en) * 1981-06-05 1985-01-08 Xerox Corporation Shared resource clustered printing system
US4441829A (en) * 1981-09-24 1984-04-10 International Business Machines Method for performing a multiple page get operation in a text processing system
US4509826A (en) * 1983-04-11 1985-04-09 Xerox Corporation Optical image staggering/destaggering arrangement for multiple array scanning system
US4996662A (en) * 1983-10-03 1991-02-26 Wang Laboratories, Inc. Method for generating document using tables storing pointers and indexes
US4809220A (en) * 1984-03-30 1989-02-28 Wang Laboratories, Inc. Electronic processing system using printer and microprocessor to create forms template with pre-printed forms
US4723210A (en) * 1984-08-30 1988-02-02 International Business Machines Corp. Superblock structure in a multiple in a data editor
US4723209A (en) * 1984-08-30 1988-02-02 International Business Machines Corp. Flow attribute for text objects
US4723211A (en) * 1984-08-30 1988-02-02 International Business Machines Corp. Editing of a superblock data structure
US4739477A (en) * 1984-08-30 1988-04-19 International Business Machines Corp. Implicit creation of a superblock data structure
US4651278A (en) * 1985-02-11 1987-03-17 International Business Machines Corporation Interface process for an all points addressable printer
US5282269A (en) * 1985-09-27 1994-01-25 Oce-Nederland B.V. Raster image memory
US4718784A (en) * 1986-11-10 1988-01-12 Electronic Programming Corporation Rating plate printing apparatus and method
US5290109A (en) * 1986-12-26 1994-03-01 Seiko Epson Corporation Electronic typewriter for printing of documents having a fixed format
US4903229A (en) * 1987-03-13 1990-02-20 Pitney Bowes Inc. Forms generating and information retrieval system
US4903067A (en) * 1987-04-28 1990-02-20 Canon Kabushiki Kaisha Multiimage forming apparatus
US4825251A (en) * 1987-05-19 1989-04-25 The Mead Corporation Imaging process involving hardening of imaging web border area photosensitive microcapsules and an apparatus useful therein
US4912491A (en) * 1987-05-30 1990-03-27 Canon Kabushiki Kaisha Apparatus for forming superimposed images
US5206951A (en) * 1987-08-21 1993-04-27 Wang Laboratories, Inc. Integration of data between typed objects by mutual, direct invocation between object managers corresponding to object types
US5303379A (en) * 1987-08-21 1994-04-12 Wang Laboratories, Inc. Link mechanism for linking data between objects and for performing operations on the linked data in an object based system
US4992956A (en) * 1987-10-08 1991-02-12 Advanced Micro Devices, Inc. Apparatus for assembling data for supply to a scanning output device
US5107423A (en) * 1988-03-26 1992-04-21 Brother Kogyo Kabushiki Kaisha Document processing device with merge function
US5204946A (en) * 1988-06-17 1993-04-20 Canon Kabushiki Kaisha Mixed text and image data processing
US5104245A (en) * 1989-01-13 1992-04-14 Casio Computer Co., Ltd. Printing apparatus with form editor
US4994968A (en) * 1989-03-30 1991-02-19 Brother Kogyo Kabushiki Kaisha Word processing device
US5280574A (en) * 1989-05-26 1994-01-18 Hitachi, Ltd. Text document management method adapted for generating plural text documents derived from the same original text document
US5287444A (en) * 1989-08-14 1994-02-15 International Business Machines Corporation Message processing system
US5001653A (en) * 1989-09-08 1991-03-19 International Business Machines Corporation Merging plotter graphics within a text environment on a page printer
US5181162A (en) * 1989-12-06 1993-01-19 Eastman Kodak Company Document management and production system
US5506697A (en) * 1990-01-05 1996-04-09 Symbol Technologies, Inc. Apparatus for processing human-readable and machine-readable documents
US5078748A (en) * 1990-02-09 1992-01-07 Hans Schwarzkopf Gmbh Substituted 1,3-diaminobenzenes, processes for their preparation and coloring agents, containing these, for keratin fibers
US5404294A (en) * 1990-02-26 1995-04-04 Karnik; Jayant D. Tag method for moving information between computers & forms
US5084831A (en) * 1990-05-01 1992-01-28 Minolta Camera Kabushiki Kaisha Printer and printing method
US5103490A (en) * 1990-06-13 1992-04-07 National Computer Systems, Inc. Method and apparatus for storing and merging multiple optically scanned images
US5379373A (en) * 1990-06-15 1995-01-03 Fuji Xerox Co., Ltd. Document layout processing method and device for carrying out the same
US6020894A (en) * 1990-08-16 2000-02-01 Canon Kabushiki Kaisha Full-color desktop publishing system
US5307266A (en) * 1990-08-22 1994-04-26 Hitachi, Ltd. Information processing system and method for processing document by using structured keywords
US5191429A (en) * 1990-09-28 1993-03-02 Xerox Corporation Electronic printing system for printing multiple images with determination of the maximum number of reduced size images to be optimally printed on a sheet of detected size without interference
US5379368A (en) * 1990-11-30 1995-01-03 Hitachi, Ltd. Printing control method and apparatus
US5615316A (en) * 1990-11-30 1997-03-25 Hitachi, Ltd. Printing control method and apparatus
US5490243A (en) * 1990-12-13 1996-02-06 F3 Software Corporation Data processing system for multi-platform print control and electronic data fill
US5384886A (en) * 1991-04-01 1995-01-24 Xerox Corporation Process for electronically printing envelopes
US5502796A (en) * 1991-07-20 1996-03-26 Brother Kogyo Kabushiki Kaisha Print device capable of printing a format sheet in which items about a print device and a document processor are completed
US5297217A (en) * 1991-08-06 1994-03-22 Eastman Kodak Company Tile-oriented technique for collectively performing image rotation scaling and digital halftone screening
US5204916A (en) * 1991-08-06 1993-04-20 Eastman Kodak Company Tile-oriented technique for collectively performing image rotation, scaling and digital halftone screening
US5202206A (en) * 1991-10-04 1993-04-13 Xerox Corporation Process for simultaneous printing of fixed data and variable data
US5506985A (en) * 1991-10-17 1996-04-09 Ricoh Company, Ltd. Method and apparatus for format conversion of a hierarchically structured page description language document
US5504891A (en) * 1991-10-17 1996-04-02 Ricoh Company, Ltd. Method and apparatus for format conversion of a hierarchically structured page description language document
US5483623A (en) * 1991-10-24 1996-01-09 Canon Kabushiki Kaisha Printing apparatus
US5303341A (en) * 1991-10-29 1994-04-12 Xerox Corporation Video processor for a printing apparatus
US5276799A (en) * 1991-10-29 1994-01-04 Xerox Corporation Expandable electronic subsystem for a printing machine
US5307458A (en) * 1991-12-23 1994-04-26 Xerox Corporation Input/output coprocessor for printing machine
US5483624A (en) * 1992-03-27 1996-01-09 Monarch Marking Systems, Inc. Programmable hand held labeler
US5499329A (en) * 1992-04-30 1996-03-12 Ricoh Company, Ltd. Method and system to handle context of interpretation in a document processing language
US5487165A (en) * 1992-04-30 1996-01-23 Ricoh Company, Ltd. Standard page description language cleartext structure generator
US5483629A (en) * 1992-04-30 1996-01-09 Ricoh Company, Ltd. Method and system to handle dictionaries in a document processing language
US5493634A (en) * 1992-06-12 1996-02-20 Xerox Corporation Apparatus and method for multi-stage/multi-process decomposing
US5717840A (en) * 1992-07-08 1998-02-10 Canon Kabushiki Kaisha Method and apparatus for printing according to a graphic language
US5611024A (en) * 1992-08-28 1997-03-11 Compaq Computer Corporation Data compression of bit map images
US5287128A (en) * 1992-08-28 1994-02-15 Moore Business Forms, Inc. Method to manufacture multiple part imaged documents
US6016380A (en) * 1992-09-24 2000-01-18 Avid Technology, Inc. Template-based edit decision list management system
US5611035A (en) * 1992-10-16 1997-03-11 International Business Machines Corporation Relational data base system for conveniently constructing graphical images
US5384901A (en) * 1992-10-22 1995-01-24 Xerox Corporation Method of rendering a color image for an output medium from symbolic image data
US5734915A (en) * 1992-11-25 1998-03-31 Eastman Kodak Company Method and apparatus for composing digital medical imagery
US5504843A (en) * 1993-01-04 1996-04-02 Xerox Corporation Apparatus and method for processing a stream of image data in a printing system
US5291243A (en) * 1993-02-05 1994-03-01 Xerox Corporation System for electronically printing plural-color tamper-resistant documents
US5500928A (en) * 1993-03-01 1996-03-19 Xionics Document Technologies, Inc. Digital printing system and process using adaptive compression
US5866286A (en) * 1993-04-16 1999-02-02 Moore Business Forms, Inc. Color selection by mixing primary toners
US5745910A (en) * 1993-05-10 1998-04-28 Apple Computer, Inc. Frame structure which provides an interface between parts of a compound document
US5880742A (en) * 1993-09-17 1999-03-09 Xerox-Corporation Spreadsheet image showing data items as indirect graphical representations
US5877865A (en) * 1993-10-26 1999-03-02 Canon Kabushiki Kaisha Image processing apparatus and method for printing data described in a page description language
US5592683A (en) * 1994-03-18 1997-01-07 Ibm Corporation System for selectively processing nested print commands and buffered post-print commands thereafter and resending selected portion of data stream upon error detection
US5495565A (en) * 1994-06-21 1996-02-27 Wang Laboratories, Inc. Integrated form document editor with form descriptor table, background bitmap, graphics editor and text editor, composite image generator and intelligent autofill
US5896462A (en) * 1994-10-04 1999-04-20 Stern; Yonatan Method for storing and retrieving images in/from a database
US6381028B1 (en) * 1995-01-18 2002-04-30 Tesseron Ltd. Method of utilizing variable data fields with a page description language
US5729665A (en) * 1995-01-18 1998-03-17 Varis Corporation Method of utilizing variable data fields with a page description language
US5594860A (en) * 1995-01-27 1997-01-14 Varis Corporation Method for banding and rasterizing an image in a multiprocessor printing system
US5729674A (en) * 1995-04-07 1998-03-17 Computer Humor Systems, Inc. Method and apparatus for producing personalized graphics and personalized text printed materials
US5706365A (en) * 1995-04-10 1998-01-06 Rebus Technology, Inc. System and method for portable document indexing using n-gram word decomposition
US5600768A (en) * 1995-06-06 1997-02-04 Apple Computer, Inc. Image generation with dynamically consolidated list of image data
US5895455A (en) * 1995-08-11 1999-04-20 Wachovia Corporation Document image display system and method
US5740338A (en) * 1995-11-13 1998-04-14 Varis Corporation Method for merging variable image data into a template image
US5727220A (en) * 1995-11-29 1998-03-10 International Business Machines Corporation Method and system for caching and referencing cached document pages utilizing a presentation data stream
US6684188B1 (en) * 1996-02-02 2004-01-27 Geoffrey C Mitchell Method for production of medical records and other technical documents
US5621020A (en) * 1996-06-19 1997-04-15 Moore Business Forms, Inc. Release composition for printable linerless labels
US6027195A (en) * 1996-11-12 2000-02-22 Varis Corporation System and method for synchronizing the piezoelectric clock sources of a plurality of ink jet printheads
US6018774A (en) * 1997-07-03 2000-01-25 Yobaby Productions, Llc Method and system for creating messages including image information
US6209010B1 (en) * 1997-07-18 2001-03-27 Varis Corporation Computer implemented method for wrapping data to an arbitrary path defined by a page description language
US20030050934A1 (en) * 1997-07-18 2003-03-13 Gauthier Forrest P. Method and system for flowing data to an arbitrary path defined by a page description language
US20050076001A1 (en) * 1997-07-18 2005-04-07 Gauthier Forrest P. Method and system for flowing data to an arbitrary path defined by a page description language
US6707572B1 (en) * 1997-09-12 2004-03-16 Tesseron, Ltd. Filtering method to reduce pixel density
US6049390A (en) * 1997-11-05 2000-04-11 Barco Graphics Nv Compressed merging of raster images for high speed digital printing
US6557017B1 (en) * 1998-02-06 2003-04-29 Xerox Corporation Image production system theme integration
US6505980B1 (en) * 1999-02-12 2003-01-14 Silver Fox Limited System and method for printing sequences of indicia
US6684016B2 (en) * 2000-08-25 2004-01-27 Lg Cable Ltd. Optical fiber for wavelength division multiplexing optical transmission system using densely spaced optical channels

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070195095A1 (en) * 2006-02-17 2007-08-23 Microsoft Corporation Applying effects to a merged text path
US7752543B2 (en) * 2006-02-17 2010-07-06 Microsoft Corporation Applying effects to a merged text path
US20080028299A1 (en) * 2006-07-31 2008-01-31 Microsoft Corporation Wrapping nodes in a drawing canvas
US20100275156A1 (en) * 2006-07-31 2010-10-28 Microsoft Corporation Managing Data Across a Semantic Data View and a Presentation Data View
US8006179B2 (en) * 2006-07-31 2011-08-23 Microsoft Corporation Wrapping nodes in a drawing canvas
US8170983B2 (en) 2006-07-31 2012-05-01 Microsoft Corporation Managing data across a semantic data view and a presentation data view
US20160041802A1 (en) * 2013-04-10 2016-02-11 Hewlett-Packard Indigo, B.V. Data transfer system, method of transferring data, and system
US9727287B2 (en) * 2013-04-10 2017-08-08 Hewlett-Packard Indigo B.V. Data transfer system, method of transferring data, and system
US20150039992A1 (en) * 2013-07-31 2015-02-05 Google Inc. Mechanism for setting ascent and baseline for html elements
US9275022B2 (en) * 2013-07-31 2016-03-01 Google Inc. Mechanism for setting ascent and baseline for HTML elements

Also Published As

Publication number Publication date
US20050076001A1 (en) 2005-04-07
US20030050934A1 (en) 2003-03-13
US6487568B1 (en) 2002-11-26
US6599325B2 (en) 2003-07-29

Similar Documents

Publication Publication Date Title
US20050286065A1 (en) Method and system for flowing data to an arbitrary path defined by a page description language
US20150082154A1 (en) Method and system for dynamic flowing data to an arbitrary path defined by a page description language
US6209010B1 (en) Computer implemented method for wrapping data to an arbitrary path defined by a page description language
US6243172B1 (en) Method and system for merging variable text and images into bitmaps defined by a page description language
US7302438B1 (en) Method and system for flowing data to an arbitrary path defined by a page description language
US7456990B2 (en) Method of utilizing variable data fields with a page description language
US6205452B1 (en) Method of reproducing variable graphics in a variable imaging system
US5630028A (en) Method of representing graphic data using text
US20040205602A1 (en) Page layout design using geometric interference schema
JP2817687B2 (en) Image forming device
US6189020B1 (en) Document processing method and apparatus using batch process
CN110196697A (en) Information processing equipment, information processing method and storage medium
WO2000028435A2 (en) Method and system for dynamic flowing data to an arbitrary path defined by a page description language
JP3775130B2 (en) Document processing apparatus and method
JP3118310B2 (en) Print processing method of page printer
JPH0863472A (en) Character composing device
JP4844364B2 (en) Image processing apparatus and program
JP2764944B2 (en) Character output device
JP2001251493A (en) Apparatus, method and system for image processing and recording medium
JPH05165455A (en) Character display processing method
JP3289541B2 (en) Printing data creation device
JPH07105197A (en) Document processor
JPH09185603A (en) Document preparing device and character string form control method
JPH08181847A (en) Information processor and information processing method
JPH05342405A (en) Method and device for editing document

Legal Events

Date Code Title Description
AS Assignment

Owner name: GAUTHIER, FORREST P., FLORIDA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TESSERON LTD.;REEL/FRAME:030603/0243

Effective date: 20130530

AS Assignment

Owner name: GAUTHIER, FORREST P., FLORIDA

Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:TESSERON LTD.;REEL/FRAME:030727/0438

Effective date: 20130628

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION