COMPUTER VISION, GRAPHICS, AND IMAGE PROCESSING 22, 204-205 (1983)

Abstracts of Papers Accepted for Publication

PAPERS Page Composition of Continrcour Tone Imagery. SAMUEL M. GOLDWASSER, Department of Computer

and Information Science, Moore School of Electrical Engineering, University of Pennsylvania, Phila- delphia, Pennsylvania 19104; AND DONALD E. TROXEL, Research Laboratory of Electronics and Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Massachusetts 02139. Received August 13, 1982; revised January 24, 1983. PbCdget

A system has been developed which represents an effective unified framework for interactive layout and page generation of pictures and linework for applications in the graphic arts. The functional structure and logical organization of this system are based upon the segment display processor (SDP) architecture which offers a generalized approach to the manipulation of multisegment multiformat data. Interactive layout is accomplished with the aid of a graphics digitizing tablet and proof TV display. Subsequent input scanning, sizing, enhancement, and merge operations are fully automatic. The system handles arbitrary- shaped regions, type-on-tone, and optimally codes areas of continuous tone and line art copy individually. The PAGES system described in this paper is centered around a software emulation of the SDP supporting continuous tone imagery and scanned type. Most of the effort devoted to this development will be directly applicable to an SDP based system implemented with the aid of special purpose high speed hardware in the future.

Octree Representations of Moving Objects. CHARLES NASH AND NARENDRA AHUJA. Coordinated Science Laboratory and Department of Electrical Engineering, University of Illinois, 1101 West Springfield Avenue, Urbana, Illinois 61801. Received July 26, 1982; revised December 30, 1982; accepted February 7, 1983.

An algorithm is described that updates an object’s octree representation as the object is linearly translated through space. This is accomplished by performing simple arithmetic on the path representa- tions of the nodes to be translated. Among others, one advantage of the algorithm is in devising collision free and efficient trajectories of moving objects in robotics.

An Approach to Figwe Dec~osition Using Width Znfomution. CARLO ARCELLI AND GABR~ELLA SANNITI DI BAJA. Istituto di Cibemetica, C.N.R., Arco Felice, Naples, Italy. Received September 20, 1982; revised December 6, 1982; accepted February 20, 1983.

Decomposition methods are sometimes convenient for shape analysis. In these cases, a representation of the digital figure in terms of some of its subsets becomes available, and a structural description can then be derived. The correspondence between the shape of the figure and the structure of its medial line is considered as a starting point to develop a decomposition technique, using mainly the width information provided by the labeled medial line. An appropriate partition of the medial line indicates the sets of pixels from which the blocks, necessary to find the constituent components, are built. A merging phase accomplishes the last step of the process.

204 0734-189X/83 $3.00 Copyright Q 1983 by Academic Press, Inc. All rights of reproduction in any form reserved.