Browse Prior Art Database

Generic Post-Processing of a PostScript Diagram of Known Bounding Box

IP.com Disclosure Number: IPCOM000116412D
Original Publication Date: 1995-Sep-01
Included in the Prior Art Database: 2005-Mar-30
Document File: 4 page(s) / 144K

Publishing Venue

IBM

Related People

Llames, RL: AUTHOR

Abstract

Disclosed is an algorithm and a coordinated set of controlling options for performing a variety of common transformations on a one page, well behaved PostScript* diagram with an arbitrary but known bounding box. The algorithm performs the transformations required to carry out any of the following tasks: 1. Print the diagram as is (that is, without any further transformation) on a single physical page. 2. Print the diagram on a single physical page within specified margins. Possibly rotate the diagram for landscape orientation. Possibly scale it by a specified factor or scale it so that it exactly fits the usable page area (that is, the area enclosed by the margins). Possibly clip it by the usable page area. 3.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 33% of the total text.

Generic Post-Processing of a PostScript Diagram of Known Bounding Box

      Disclosed is an algorithm and a coordinated set of controlling
options for performing a variety of common transformations on a one
page, well behaved PostScript* diagram with an arbitrary but known
bounding box.  The algorithm performs the transformations required to
carry out any of the following tasks:
  1.  Print the diagram as is (that is, without any further
       transformation) on a single physical page.
  2.  Print the diagram on a single physical page within specified
       margins.  Possibly rotate the diagram for landscape
orientation.
       Possibly scale it by a specified factor or scale it so that it
       exactly fits the usable page area (that is, the area enclosed
by
       the margins).  Possibly clip it by the usable page area.
  3.  Print the diagram on multiple physical pages (or more
precisely,
       on an M x N matrix of physical pages), where each page has
       specified margins.  Possibly rotate each page in the matrix
for
       landscape orientation.  Possibly scale the diagram by a
specified
       factor or scale it so that it exactly fits the usable diagram
       area (that is, the conceptual area made up of an M x N matrix
of
       usable page areas).  Possibly clip it by the usable page
areas.
  4.  Do not print it as a standalone diagram, but prepare it for
       inclusion in another document.  The preparation may involve
       scaling (by an explicit or implicit factor), rotation for
       landscape orientation, and imposition of a new, arbitrary
       bounding box.

      The general problem presented by the preceding tasks is to
define an algorithm capable of doing all the required
transformations,
and a set of parameters to the algorithm (called "options" in this
disclosure) that will allow a user to specify precisely what
transformation should be done.  In particular, disclosed is a
generic,
minimal, and coherent set of options, and precedence relationships
between the options.

      Note that the term options is used here in a generic sense.
The conceptual options can be implemented as parameters to a
procedure in a high-level language such as PostScript or Lisp, or as
command-line arguments in UNIX or DOS, or as menu options in an
interactive window-based system.

      The options that are defined can be organized into four
categories, as follows.  For purposes of this disclosure, assume that
options have typed values.  In the following list, the type of an
option value is specified.

      In any actual implementation, there will be other details to be
concerned about, such as default values, and a possible difference in
semantics between when an option is specified and when it is not.
However, in this disclosure, these details are not specified.
      Option name        Typ...