Abstract: A method of converting continuous 3-D (three dimension) geometrical representations of polygonal objects into a discrete set of voxels in discrete 3-D voxel space. In one embodiment, a method is provided for converting a continuous 3-D polygon into a discrete set of voxels connected together in discrete 3-D voxel space. In this embodiment, voxel-based polygons having a wide variety of connectivities are generated. In another embodiment, a method is provided for converting a continuous 3-D polyhedron into a discrete set of voxels connected together in discrete 3-D voxel space. The method is incremental in nature and uses all integer arithmetic. The method is also characterized by decisional process loops, rather than brute-force type computational loops characteristic of prior art methodologies.

Abstract: An image processor having an image algorithm processor (66) operating under control of a writable control store (94), and a number of parallel image processors (72) operating under control of instruction words from a writable control store (100). An image memory controller (68) receives memory addresses from the image algorithm processor (66) for coordinating the reading and writing of an image memory (82) using pixel data processed by the parallel image processor set (72). The image memory controller (68) arbitrates memory address request cycles, memory refresh cycles and screen refresh cycles. The image memory (82) includes different planes (84, 86 and 88) associated with red, green and blue pixel data. Associated with each image memory plane is a video processor (106) for converting parallel image data to high speed serial image data.

Abstract: A method and apparatus for performing graphic compositing operations in a computer system, with improved system performance, is provided. The apparatus and method performs the plurality of compositing operations by implementing a series of write functions, selected from a group of write functions, in a predetermined combination or order.

Abstract: An interactive computer graphics display system processing method for identifying a displayed primitive that intersects an operator selected area of the display screen. Pursuant to the method, the operator selected area of the display screen is reverse mapped to world coordinate space; data representative of displayed geometric primitives is then clipped against the reverse mapped selected area in world coordinate space; and clipped data representative of displayed geometric primitives that intersect the reverse mapped selected area are identified for operator defined application processing. Further processing steps include mapping of the identified data to screen coordinate space and rasterization of the data for display in the screen monitor.

Abstract: A ruled line block processing apparatus has a ROM, a RAM, a keyboard including a ruled line block key and a breakpoint mark key, a CPU, a character generator, and a printer. The RAM includes areas of a document memory, a block memory, a vertical ruled line table, a small block range table, a value indicating the number of small blocks, a ruled line flag, a ruled line termination flag, a ruled line start flag, and a cursor position memory. Character data read out from the document memory is relocated with ruled lines in a block format in accordance with the small block range table, the number of small blocks, and the breakpoint mark entered in the keyboard at a breakpoint mark position in the character data.

Abstract: A computerized editing and composing system and method which conveniently and directly edits and composes complex scientific formulas, chemical structural formulas and music staves. The system comprises a computer, an I/O interface, an input device, a character library and character generating system, a display, an editing and composing process device and peripheral devices, and automatically processes the corresponding text while providing the user with a simple and convenient operational interface with inputting, editing, composing and outputting techniques to generate the different resolutions of the output.

Abstract: A controller for a printer for printing data received from an external data processor. The controller comprises a first memory for storing the received data, an analyzer for analyzing the data stored in the first memory, and a second memory for storing the data analyzed by the analyzer. In the controller, the data stored in the first memory corresponding to the data stored in the second memory is reanalyzed by the analyzer in accordance with alteration of a format data.

Abstract: A Memory Interface and Video Attribute Controller (MIVAC) is inserted between a dynamic RAM (DRAM) capable of a consecutive data read operation, such as the operation associated with the static column mode, page mode, or nibble mode, and a graphic processor to provide a parallel data processing. A serial data transfer is executed on each data bus between the MIVAC and the DRAM, whereas parallel data transfer is conducted between the MIVAC and the graphic processor. As a result, the graphic processor can be configured with a reduced number of DRAMs so that the graphic processor operates without paying attention to the consecutive data read mode of the DRAM.

Abstract: A photo printer such as a laser printer incorporates a bit map memory having a large memory capacity. When the printer is connected to a host computer, a dot pattern corresponding to a bit pattern formed in accordance with the contents of the bit map memory is printed on a sheet in a normal mode. If a special command is transmitted from the host computer to the printer, a data file used by the host computer is temporarily stored in the bit map memory. If another special command is transmitted from the host computer, the data file stored in the bit map memory is transmitted to the host computer. That is, the bit map memory in the printer is used as the memory for temporarily storing the files of the host computer.

Abstract: Information including pictures, sounds, and characters is inputted. A form of the inputted information is converted into a prescribed format in accordance with properties of the information, and thus converted information is derived. A first storage means holds the inputted information and/or the converted information. The information held in the first storage means is edited, and thus edited information is derived. A reproduction sequence is generated. A second storage means holds the edited information. The information held in the first storage means and/or the second storage means is reproduced in the reproduction sequence to allow a check on the information and the reproduction sequence. The information held in the first storage means or the second storage means is outputted for manufacturing a recording medium.

Abstract: A kiosk is placed on a sidewalk and has stored in an electronic memory the locations of businesses, historical sites, or the like within a predetermined distance of the kiosk. In addition, a map of the area surrounding the kiosk is stored. The kiosk has an input panel having a plurality of input keys, each key corresponding to a characteristic of the subscribers stored in the electronic memory. A user activates the apparatus by pressing one of the input keys. This causes an electronic element to search the subscribers to determine the group of subscribers having that characteristic. Then, a map is generated, and the location of the selected group of subscribers are overlaid onto the map. The map with the group of subscribers thereon is then printed and dispensed to the user.

Abstract: A system for creating images for use in printing wrappers comprises a video image reader and a graphic console, a keyboard, a graphic tablet and a monitor to receive, to combine and modify image signals and colors. The system combines video and vectorial image signals and creates one picture or a series of pictures simulating a product wrapper, or a repetition of wrappers or products with such wrappers thereon.

Abstract: A screen display includes a path context window for displaying a signal path in its entirety apart from the schematic sheets on which the path portions appear. The window contains multiple display portions each graphically displaying a path portion appearing on a separate schematic sheet. The multiple display portions are arranged adjacent to each other to display the entire signal path as continuous. The screen display also includes a path list window and may include view sheet windows each showing a schematic sheet of a path portion in the path context window. A user selects a path from the path list window, which causes a path context window containing the selected path to appear. Selecting a path portion from the displayed signal path causes a view sheet window containing the corresponding schematic sheet to appear. The means for producing the various windows and other features of the screen display is also disclosed.

Abstract: Automatic orientation of predefined chemical structures in conjunction with a computer terminal employs respective protocols corresponding to a system state. The system states can include a chain state, ring state, library state, and retrieve state. Upon orientation, the object is attached according to a specified attachment command to a parent graph. The protocols corresponding to connection of the object to the parent includes rules regarding angles at which the structures can be attached to one another, and another protocol governs rules respecting rotation of the stored object through predetermined angles. Nodes of the object recalled are automatically provided with markers in alphabetic order from the most recently used marker corresponding to a letter of alphabet. Multiple alphabet sequences are used. Specification of position is indicated by inputting the lower case letter of the alphabet corresponding to the location desired. Bonds can be specified between two markers.

Abstract: A graphics processor having an independent processor for traversing a hierarchical graphics data base. The independent processor, termed a "tree traverser", generates a stream of addresses to the memory in which the data base is stored, producing a stream of data over a private, unidirectional data path to a geometry processor.

Abstract: A method for computing, in a computer with a television terminal, spatially transformed locations for samples in three-dimensional image space, of which a two-dimensional view is afforded on the television terminal. The spatial transformation of sample locations allows objects to be rotated, precessed or translated on the viewing screen of the television terminal. The original locations of samples are considered to be along a path in image space proceeding from a starting point sample. A spatial transform of the starting point is computed. The successive vector differences between successive samples along the path are determined, and the various values of these vector differences are spatially transformed. Spatially transformed samples are successively generated along the spatially transformed path in image space by successively adding the spatially transformed vector differences to the spatially transformed starting point sample, in an accumulation procedure.

Abstract: A graphics system uses a programmable tile size and shape supported by a frame buffer memory organization wherein (X, Y) pixel addresses map into regularly offset permutations on groups of RAM address and data line assignments. This allows one RAM in eac group to be accessed with a memory cycle in unison with one RAM in each other group, up to the number of groups. During such a memory cycle each RAM can receive a different address. A tile is the collection of pixel locations associated with a collection of addresses sent to the RAM's. Because of the regular nature of the permutations these locations may be regions bounded by a single boundary that may be rectangular and of varying size and shape. Changing the mapping of (X, Y) pixel addresses to RAM addresses for the groups changes the size and shape of the tiles.

Abstract: A video imaging device coupled to a host computer by a communication line over which control data is transmitted, to one or more sources of video information, and to a monitor by a video line over which video signals based upon the video information and control data are transmitted, includes a converting unit for converting the video information into the video signals for transmittal to the monitor. A receiver receives the control data transmitted over the communication line. The control data includes condition data and associated instruction data with at least some of the instruction data being adapted to alter at least some of the condition data upon execution of the associated instruction data. Stored condition data may be selected in response to user generated event data and display of the video signals on the monitor is manipulated by execution of the instruction data associated with the selected condition data.

Abstract: An electronic product information display system includes a plurality of self-contained display modules (10) mounted proximate to respective products. A signal (22) is formed that comprises an address part and a data part, the adderess part corresponding to a selected module address and the data part encoding product information (18, 20) to be displayed by the addressed module (10). The signal a broadcast from a transmitter (24) remote from a plurality of modules (10). Modules (10) each receive the signal, decode the address part into a received address, and decode the data part into product information (18, 20). The product information is stored and displayed responsive to a match between the module address and the received address. The signal (22) is preferably infrared.

Abstract: Two polygon fill algorithms are presented for filling polygons on a graphics display. The first polygon fill algorithm fills polygons that are strictly convex. The second polygon fill algorithm fills a larger class of polygons than the first polygon fill algorithm which includes polygons being concave in the x direction, and polygons having crossing lines. The first polygon fill algorithm tests the polygon for strict convexity by testing for a consistent turning direction, and by testing for once around in the y direction. The first polygon fill algorithm then stores the maximum and minimum value of the pel selected by the Bresenham algorithm for each scan line of the polygon. The fill line is drawn from the pel having the minimum value to the pel having the maximum value for each scan line of the polygon. The second polygon fill algorithm tests the polygon to ensure that it can be filled with one unique fill line for each scan line of the polygon.