Abstract: License management systems and methods allow licenses for a computer program to be available for use at each of a plurality of nodes of a network. If a valid license file at a local node contains an unexpired, available license, a license manager at the local node permits the computer program to be executed at the requesting local node. If no such license is available in a valid license file at such local node, the license manager searches the other nodes for a valid license file containing an unexpired, available license. In one embodiment, if an unexpired available license is located in a valid license file at a second (or "remote") node, the license manager transfers such license to the local node, and assigns and encrypts a unique identification to such transferred license. The original record of the transferred license is modified by erasing it from the license file at the remote node so that the transferred license is no longer available there.

Abstract: A pixel control system and method of controlling the intensity of pixels on a raster video display screen with scan lines grouped in 20 pixel increments across the scan line to display an object. In a first operational sequence for a given polygon that represents a part of the object separate red, blue, green and depth sections use the value (R) of a reference pixel in a first pixel group at the left side of the object to determine the pixel by pixel change (delta) in intensity and depth across the first pixel group. The sections are operated in successive operational sequences to process the other pixel groups along the scan line until the pixel group at the right side of the polygon is processed. The operations are repeated in respect to successive scan lines to process the entire polygon. Each section has two adder stages. The first stage produces signals representing R, R plus and minus certain deltas and selected other deltas.

Abstract: A system for converting vector data to pixel data to draw the vector on a display screen. The display screen is divided into groups of pixels (matrices) each having a certain number of pixels in the x and y directions. As the vector data for a given matrix is processed, the next matrix through which the vector extends is identified according to where the vector extends in relation to two decision points within the given matrix. If the vector is above a first one of such points, the next matrix is in the x direction, whereas if the vector is below the second one of such points the next matrix is in the y direction. If the vector extends between such points, the next matrix is one matrix away in both the x and y directions.

Abstract: Data is generated for graphically displaying objects having surfaces defined by vertex locations, each having a particular intensity. The values of electrical signals that represent the coordinates of the vertex locations and a point normal used to obtain the intensities are controlled by programming a computer to generate electrical signals that represent coordinates of the vertices. The values of each of the coordinates is in terms of an equation having parameters "s" and "t". "t" is identified and kept constant at a first amount. The coordinate equations are factored to redefine them in terms of a first constant and a variable represented by "s". The equations are sequentially solved by substituting therein a predetermined series of values for "s" to control the values of the electrical signals so that certain of the signals represent ones of the coordinated that form a first row of the vertices.

Abstract: A system to convert vector data to pixel data for drawing a vector on display screen that is divided into groups of pixels (matrices) having selected numbers of pixels in the x and y coordinate directions. The vector data is processed to define the slope of the vector and the number of matrices in the x and y directions the vector extends through. Counters are set to such numbers. Starting with the first matrix in which one end of the vector is located, a circuit defines which pixels must be enabled to draw the vector through that matrix. According to the location of the vector relative to decision points in the first matrix, a circuit identifies the next matrix through which the vector extends and causes the counter to count. This continues until the last matrix is identified and the pixels therein are enabled. An additional circuit masks those pixels, if any, in the first and last matrices that are beyond the end of the vector.